2013/02/05 by Marcel Wild, Wild, Marcel
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1302.1039
This version 4 adds subsections 3.2 and 4.2 and one new reference
arxiv created 2013/11/05 · arxiv updated 2013/11/06
Given are the facets of an abstract (finite) simplicial complex SC. We show how to partition SC into few pieces, each one compactly encoded by the use of wildcards. Such a representation is useful for the optimization of a target function SC -> Z, as well as in combinatorial commutative algebra and Frequent Set Mining. Merely calculating the face-numbers of SC can be done faster than partitioning SC. Our method compares favorably to inclusion-exclusion and binary decision diagram