The double of a simplicial complex
math.CO, math.AT
Submitted: 2025-06-12
Updated: 2026-10-27
Comments: final version. To appear in Combinatorial Theory
License: http://creativecommons.org/licenses/by/4.0/
The gist: We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory.
Terminology
Abstract
We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times faster in homological stability.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality