A problem from the domain of combinatorial analysis

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.