2-LC triangulated manifolds are exponentially many
Bruno Benedetti, Marta Pavelka

TL;DR
This paper introduces and analyzes $t$-LC triangulated manifolds, establishing bounds on their number and exploring their topological properties, thereby extending known results in combinatorial topology.
Contribution
It defines $t$-LC manifolds and complexes, proves exponential bounds on their counts, and links $t$-constructibility with topological depth, generalizing prior concepts.
Findings
Number of 2-LC $d$-manifolds with $N$ facets is at most $2^{rac{d^3}{2}N}$.
All $t$-constructible pseudomanifolds are $t$-LC.
$t$-constructible complexes have homotopical depth > $d-t$.
Abstract
We introduce "-LC triangulated manifolds" as those triangulations obtainable from a tree of -simplices by recursively identifying two boundary -faces whose intersection has dimension at least . The -LC notion interpolates between the class of LC manifolds introduced by Durhuus--Jonsson (corresponding to the case ), and the class of all manifolds (case ). Benedetti--Ziegler proved that there are at most triangulated -LC -manifolds with facets. Here we prove that there are at most triangulated -LC -manifolds with facets. This extends to all dimensions an intuition by Mogami for . We also introduce "-constructible complexes", interpolating between constructible complexes (the case ) and all complexes (case ). We show that all -constructible pseudomanifolds are -LC, and that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Topological and Geometric Data Analysis · Advanced Combinatorial Mathematics
