English
Related papers

Related papers: Ramanujan Complexes and bounded degree topological…

200 papers

A Riemannian manifold is a called a good rational expander in dimension $i$ if every $i$-cycle bounds a rational $i+1$-chain of comparatively small volume. We construct 3-manifolds which are good expanders in all dimensions. On the other…

Geometric Topology · Mathematics 2024-05-09 Jonathan Zung

Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…

Combinatorics · Mathematics 2021-02-11 Tali Kaufman , Izhar Oppenheim

We discuss two combinatorical ways of generalizing the definition of expander graphs and Ramanujan graphs, to quotients of buildings of higher dimension. The two possible definitions are equivalent for affine buildings, giving the notion of…

Combinatorics · Mathematics 2017-01-03 Amitay Kamber

We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let $X$ be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension $d$. Informally, the theorem states that if $X$…

Geometric Topology · Mathematics 2016-09-20 Dominic Dotterrer , Tali Kaufman , Uli Wagner

Coboundary expansion (with $\mathbb{F}_2$ coefficients), and variations on it, have been the focus of intensive research in the last two decades. It was used to study random complexes, property testing, and above all Gromov's topological…

Group Theory · Mathematics 2024-04-02 Michael Chapman , Alexander Lubotzky

High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…

Combinatorics · Mathematics 2026-05-22 Max Hopkins , Arka Ray

Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…

Algebraic Topology · Mathematics 2020-12-14 Eric Bunch , Qian You , Glenn Fung , Vikas Singh

We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is…

Combinatorics · Mathematics 2007-05-23 Jaroslav Nesetril , Patrice Ossona De Mendez

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

Combinatorics · Mathematics 2017-11-23 Michael Dinitz , Michael Schapira , Gal Shahaf

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…

Geometric Topology · Mathematics 2017-03-06 Anders Björner , Afshin Goodarzi

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…

Combinatorics · Mathematics 2022-10-04 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang

In this paper, we consider a structural and geometric property of graphs, namely the presence of large expanders. The problem of finding such structures was first considered by Krivelevich [SIAM J. Disc. Math. 32 1 (2018)]. Here, we show…

Combinatorics · Mathematics 2023-02-22 Baptiste Louf , Fiona Skerman

Graph eigenvalues play a fundamental role in controlling structural properties, such as bisection bandwidth, diameter, and fault tolerance, which are critical considerations in the design of supercomputing interconnection networks. This…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-04-10 Sinan G. Aksoy , Paul Bruillard , Stephen J. Young , Mark Raugas

This paper considers a higher-dimensional generalization of the notion of Ramanujan graphs, defined by Lubotzky, Phillips, and Sarnak. Specifically the Ramanujan property is studied for cubical complexes which are uniformized by an ordered…

Number Theory · Mathematics 2007-05-23 Bruce W. Jordan , Ron Livné

In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…

Combinatorics · Mathematics 2023-12-27 Louis Golowich

In this article, we construct new families of Ramanujan complexes with local structure distinct from all previously known examples. Our approach is based on unitary groups over number fields, more specifically on what we call super-definite…

Number Theory · Mathematics 2026-03-09 Rahul Dalal , Alberto Mínguez , Jiandi Zou

We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs. They are obtained as quotients of the buildings of type $\tilde{A}_{d-1}$ associated with…

Representation Theory · Mathematics 2007-05-23 Alex Lubotzky , Beth Samuels , Uzi Vishne

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

Combinatorics · Mathematics 2022-02-09 Arindam Biswas , Jyoti Prakash Saha

Double triangle expansion is an operation on $4$-regular graphs with at least one triangle which replaces a triangle with two triangles in a particular way. We study the class of graphs which can be obtained by repeated double triangle…

Combinatorics · Mathematics 2019-04-16 Mohamed Laradji , Marni Mishna , Karen Yeats

We define $k$-dimensional digraphs and initiate a study of their spectral theory. The $k$-dimensional digraphs can be viewed as generating graphs for small categories called $k$-graphs. Guided by geometric insight, we obtain several new…

Operator Algebras · Mathematics 2022-11-08 Nadia S. Larsen , Alina Vdovina