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
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.