Institute of Information Theories and Applications FOI ITHEA
Abstract
Composition problem is considered for partition constrained vertex subsets of n dimensional unit cube
E^n . Generating numerical characteristics of E^n subsets partitions is considered by means of the same
characteristics in 1 − n dimensional unit cube, and construction of corresponding subsets is given for a special
particular case. Using pairs of lower layer characteristic vectors for E^(1-n) more characteristic vectors for
E^n are composed which are boundary from one side, and which take part in practical recognition of validness of a given
candidate vector of partitions