m进制向量含指定孤立r元组的计数

Enumeration of m-digit vectors with prescribed subsets of isolated r-tuple

主要介绍了ｍ进制ｎ维向量空间Ｆ（ｎ）ｍ中关于是否含孤立ｒ元组的向量的计数问题。特别是Ｆ（ｎ）２中的计数。对于上述问题，主要确定了计数函数的递推公式和组合公式表示。

This paper treats a combinatorial problem on counting the number of m-digit vectors with prescribed subsets of isolated r-tuple in n-dimensional space, especially binary vectors in n-space. For these problems, recursion formulas and combinatorial formulas are derived.