Year: 2013
Type: preprint
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
Source: arXiv (Cornell University)
Author: Wild, Marcel
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1499844746