A GENERALIZATION OF A COMBINATORIAL PROBLEM OF SMIRNOV.
SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF
Pagination or Media Count:
In 1966 N.V. Smirnov proposed the following combinatorial problem given n objects of s1 classes how many ways can the n objects be arranged in a chain so that adjacent objects belong to separate classes. In 1967, O.V. Sarmanov and V.K. Zaharov derived some asympotic results on this problem. The present paper extends and generalizes this work.
- Statistics and Probability