Compression with wildcards: Abstract simplicial complexes
Data Structures and Algorithms
2021-03-10 v3 Combinatorics
Abstract
Despite the more handy terminology of abstract simplicial complexes SC, in its core this article is about antitone Boolean functions. Given the maximal faces (=facets) of SC, our main algorithm, called Facets-To-Faces, outputs SC in a compressed format. The degree of compression of Facets-To-Faces, which is programmed in high-level Mathematica code, compares favorably to both the Mathematica command BooleanConvert, and to the BDD's provided by Python. A novel way to calculate the face-numbers from the facets is also presented. Both algorithms can be parallelized and are applicable (e.g.) to reliability analysis, combinatorial topology, and frequent set mining.
Cite
@article{arxiv.1812.02570,
title = {Compression with wildcards: Abstract simplicial complexes},
author = {Marcel Wild},
journal= {arXiv preprint arXiv:1812.02570},
year = {2021}
}
Comments
23 pages