Search arXivSearch

arXiv · 2306.14317

Topological expansion for posets and the homological $k$-connectivity of random $q$-complexes

Abstract

We study high dimensional expansion beyond simplicial complexes (posets) and focus on $q$-complexes which are complexes whose basic building blocks are linear spaces. We show that the complete $q$-complex (consists of all subspaces of a given linear space) may have non-trivial homology groups and therefore some techniques for simplicial complexes fail. We develop new techniques to work bypass this. In particular: (i) We describe a new construction of cones and use it to determine when the homology of the complete $q$-complex is trivial. We use this construction to prove the "projective support dimension conjecture" conjectured by Mnukhin and Siemons. (ii) We define topological high dimensional expansion for posets, and show that the complete $q$-complex has linear (in the number of lines) coboundary expansion. (iii) We define the $q$-Linial-Meshulam model of random $q$-complexes and prove a sharp threshold for the connectivity of random $q$-complexes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ran Tessler, Elad Tzalik. 2026-07-28. Topological expansion for posets and the homological $k$-connectivity of random $q$-complexes. https://arxiv.org/abs/2306.14317

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO