Geodesic
A~problem from the domain of combinatorial analysis
Matematičeskie zametki, Tome 3 (1968) no. 1, pp. 15-20.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{MZM_1968_3_1_a1,
     author = {S. S. Kislitsyn},
     title = {A~problem from the domain of combinatorial analysis},
     journal = {Matemati\v{c}eskie zametki},
     pages = {15--20},
     publisher = {mathdoc},
     volume = {3},
     number = {1},
     year = {1968},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1968_3_1_a1/}
}
TY  - JOUR
AU  - S. S. Kislitsyn
TI  - A~problem from the domain of combinatorial analysis
JO  - Matematičeskie zametki
PY  - 1968
SP  - 15
EP  - 20
VL  - 3
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1968_3_1_a1/
LA  - ru
ID  - MZM_1968_3_1_a1
ER  - 
%0 Journal Article
%A S. S. Kislitsyn
%T A~problem from the domain of combinatorial analysis
%J Matematičeskie zametki
%D 1968
%P 15-20
%V 3
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1968_3_1_a1/
%G ru
%F MZM_1968_3_1_a1
S. S. Kislitsyn. A~problem from the domain of combinatorial analysis. Matematičeskie zametki, Tome 3 (1968) no. 1, pp. 15-20. http://geodesic.mathdoc.fr/item/MZM_1968_3_1_a1/