2-LC triangulated manifolds are exponentially many

DOI10.4171/AIHPD/170arXiv2106.12136OpenAlexW3173168545MaRDI QIDQ6371019FDOQ6371019

Authors: Bruno Benedetti, Marta Pavelka 

Publication date: 22 June 2021

Abstract: We introduce "$t$-LC triangulated manifolds" as those triangulations obtainable from a tree of $d$-simplices by recursively identifying two boundary $(d-1)$-faces whose intersection has dimension at least $d-t-1$. The $t$-LC notion interpolates between the class of LC manifolds introduced by Durhuus--Jonsson (corresponding to the case $t=1$), and the class of all manifolds (case $t=d$). Benedetti--Ziegler proved that there are at most $2^{d^2,N}$ triangulated $1$-LC $d$-manifolds with $N$ facets. Here we prove that there are at most $2^{frac{d}^{3}2N}$ triangulated $2$-LC $d$-manifolds with $N$ facets. This extends to all dimensions an intuition by Mogami for $d=3$. We also introduce "$t$-constructible complexes", interpolating between constructible complexes (the case $t=1$) and all complexes (case $t=d$). We show that all $t$-constructible pseudomanifolds are $t$-LC, and that all $t$-constructible complexes have (homotopical) depth larger than $d-t$. This extends the famous result by Hochster that constructible complexes are (homotopy) Cohen--Macaulay.

Full work available at URL: https://doi.org/10.4171/aihpd/170

Recommendations

• Collapses, products and LC manifolds
• On locally constructible manifolds
• On locally constructible spheres and balls
• A Cheeger-type exponential bound for the number of triangulated manifolds
• A construction principle for tight and minimal triangulations of manifolds

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Polyhedral manifolds (52B70) Triangulating manifolds (57Q15) Triangulating (57R05) Topological manifolds (57Nxx) Shellability for polytopes and polyhedra (52B22)

This page was built for publication: 2-LC triangulated manifolds are exponentially many

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