Accession Number:

AD0680108

Title:

A GENERALIZATION OF A COMBINATORIAL PROBLEM OF SMIRNOV.

Descriptive Note:

Professional paper,

Corporate Author:

SYSTEM DEVELOPMENT CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1968-11-18

Pagination or Media Count:

42.0

Abstract:

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.

Subject Categories:

  • Statistics and Probability

Distribution Statement:

APPROVED FOR PUBLIC RELEASE