Pu Heping, Huang Tinzhu. Unified Formulas for Two Kinds of Linear Permutation Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1998, 27(3): 332-336.
Citation:
Pu Heping, Huang Tinzhu. Unified Formulas for Two Kinds of Linear Permutation Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1998, 27(3): 332-336.
Pu Heping, Huang Tinzhu. Unified Formulas for Two Kinds of Linear Permutation Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1998, 27(3): 332-336.
Citation:
Pu Heping, Huang Tinzhu. Unified Formulas for Two Kinds of Linear Permutation Counting Problems[J]. Journal of University of Electronic Science and Technology of China, 1998, 27(3): 332-336.
Unified Formulas for Two Kinds of Linear Permutation Counting Problems
Some relationships between two kinds of linear permutation counting problems exist in the set of m level digital sequences of length n whose maximal run length and minimal run length satisfy some constrains respectively.In this paper,some unified formulas are given which solve the above problems.A combinatorial identical relation is also obtained.
ISSN 
DownLoad: