Institute of Information Theories and Applications FOI ITHEA
Any set system can be represented as an n -cube vertices set. Restricted sets of n -cube weighted
subsets are considered. The problem considered is in simple description of all set of partitioning characteristic
vectors. A smaller generating sets are known as “boundary” and ”steepest” sets and finally we prove that the
intersection of these two sets is also generating for the partitioning characteristic vectors.
* The research is supported partly by INTAS: 04-77-7173 project, http://www.intas.be