Related papers: Ramanujan Complexes and bounded degree topological…

Following Gromov, the coboundary expansion of building-like complexes is studied. In particular, it is shown that for any $n \geq 1$, there exists a constant $\epsilon(n)>0$ such that for any $0 \leq k <n$ the $k$-th coboundary expansion…

We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete graphs are expanders, our sparsifiers of arbitrary graphs can be viewed as…

Let $G$ be a topological group acting on a simplicial complex $\mathcal{X}$ satisfying some mild assumptions. For example, consider a $k$-regular tree and its automorphism group, or more generally, a regular affine Bruhat-Tits building and…

Classes with bounded expansion, which generalise classes that exclude a topological minor, have recently been introduced by Ne\v{s}et\v{r}il and Ossona de Mendez. These classes are defined by the fact that the maximum average degree of a…

We extend to an arbitrary number field the best known bounds towards the Ramanujan conjecture for the groups GL(n), n=2, 3, 4. In particular, we present a technique which overcomes the analytic obstacles posed by the presence of an infinite…

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…

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 describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an idea of M. Gromov and A. Nabutovski. The immediate application,…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

In a previous paper an asymptotic expansion for lambda_d in powers of 1/d was developed. The results of computer computations for some terms in the expansion, as well as various quantities associated to the expansion, are herein presented.…

We construct $d$-dimensional pure simplicial complexes and pseudo-manifolds (without boundary) with $n$ vertices whose combinatorial diameter grows as $c_d n^{d-1}$ for a constant $c_d$ depending only on $d$, which is the maximum possible…

We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…

We generalize the zig-zag product construction to produce infinite families of regular graphs of any constant degree. We analyze the second largest eigenvalue of this new zig-zag product to show that the modified zig-zag product of good…

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…

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…

Jord\'an and Tanigawa recently introduced the $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G$. This is a quantitative measure of the $d$-dimensional rigidity of $G$ which generalizes the well-studied notion of spectral…

In this article, we explore the problem of constructing high-dimensional expanders through the study of relations between expansion constants over different rings. We investigate expansion constants of integer matrices regarded as morphisms…

We wish to renew the discussion over recent combinatorial structures that are 3-uniform hypergraph expanders, viewing them in a more general perspective, shedding light on a previously unknown relation to the zig-zag product. We do so by…

We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…