How to partition or count an abstract simplicial complex, given its facets

Publication date 5 February 2013

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

This page was built for publication: How to partition or count an abstract simplicial complex, given its facets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239365)