A GENERALIZATION OF A COMBINATORIAL PROBLEM OF SMIRNOV.
Abstract
In 1966 N.V. Smirnov proposed the following combinatorial problem: given n objects of s+1 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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 18, 1968
- Accession Number
- AD0680108
Entities
People
- Bennet Lientz
- Ronald Alter
Organizations
- System Development Corporation