Related papers: Topological expanders, coarse geometry and thick e…

We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homogeneous geometric lattices, including the spherical building…

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…

We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…

Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to…

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

We prove various obstructions to the existence of regular maps (or coarse embeddings) between commonly studied spaces. For instance, there is no regular map (or coarse embedding) $\mathbb H^n\to\mathbb H^{n-1}\times Y$ for $n\geq 3$, or…

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

The twisted Alexander polynomials of a space, associated to a linear representation $\sigma$ of the fundamental group, are non-abelian refinements of the classical Alexander polynomial from knot theory. In this paper, we show that they…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

High-dimensional expanders are a generalization of the notion of expander graphs to simplicial complexes and give rise to a variety of applications in computer science and other fields. We provide a general tool to construct families of…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

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…

High-dimensional expanders generalize the notion of expander graphs to higher-dimensional simplicial complexes. In contrast to expander graphs, only a handful of high-dimensional expander constructions have been proposed, and no elementary…