Abstract: 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.

ACM Classification Keywords: G.2.1 Discrete mathematics: Combinatorics

Link:

DESCRIPTION REDUCTION FOR RESTRICTED SETS OF (0,1) MATRICES 1

Hasmik Sahakyan

http://www.foibg.com/ijita/vol14/ijita14-4-p02.pdf