|
A problem from the domain of combinatorial analysis
S. S. Kislitsyn V. A. Steklov Institute of Mathematics of the Sverdlovsk Division of the USSR Academy of Sciences
Abstract:
A problem on the separation of a finite set in accordance with the properties of its elements is analyzed. A class of sets which are extremal in the sense that their separation by the best criterion is the most asymmetric is introduced. An estimate of the capacity of similar sets is given. The application of the results to the problems of classification and ordering of a finite collection is considered.
Received: 31.07.1967
Citation:
S. S. Kislitsyn, “A problem from the domain of combinatorial analysis”, Mat. Zametki, 3:1 (1968), 15–20; Math. Notes, 3:1 (1968), 11–14
Linking options:
https://www.mathnet.ru/eng/mzm6646 https://www.mathnet.ru/eng/mzm/v3/i1/p15
|
Statistics & downloads: |
Abstract page: | 273 | Full-text PDF : | 113 | First page: | 1 |
|