English
Related papers

Related papers: Isoperimetric Inequalities for Ramanujan Complexes…

200 papers

Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…

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

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

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…

Geometric Topology · Mathematics 2019-10-30 Meru Alagalingam

In this paper, the second of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs has girth tending to infinity, then the maximal coarse Baum-Connes assembly map is an…

K-Theory and Homology · Mathematics 2010-12-21 Rufus Willett , Guoliang Yu

Kahale proved that linear sized sets in $d$-regular Ramanujan graphs have vertex expansion $\sim\frac{d}{2}$ and complemented this with construction of near-Ramanujan graphs with vertex expansion no better than $\frac{d}{2}$. However, the…

Combinatorics · Mathematics 2021-02-23 Theo McKenzie , Sidhanth Mohanty

In this work we introduce a new notion of expansion in higher dimensions that is stronger than the well studied cosystolic expansion notion, and is termed {\em Collective-cosystolic expansion}. We show that tensoring two cosystolic…

Quantum Physics · Physics 2020-11-17 Tali Kaufman , Ran J. Tessler

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…

Combinatorics · Mathematics 2012-05-21 Jaroslav Nešetřil , Patrice Ossona de Mendez , David R. Wood

The question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion…

Combinatorics · Mathematics 2022-04-01 Amitay Kamber , Tali Kaufman

We develop a new degree theory for 4-dimensional, asymptotically conical gradient expanding solitons. Our theory implies the existence of gradient expanding solitons that are asymptotic to any given cone over $S^3$ with non-negative scalar…

Differential Geometry · Mathematics 2025-01-27 Richard H. Bamler , Eric Chen

Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…

Combinatorics · Mathematics 2023-12-12 Lior Gishboliner , Zhihan Jin , Benny Sudakov

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…

Combinatorics · Mathematics 2014-07-24 Alexander Lubotzky , Roy Meshulam , Shahar Mozes

In this paper we consider nonnegatively curved finite dimensional Alexandrov spaces with a non-collapsing condition, i.e., such that unit balls have volumes uniformly bounded from below away from zero. We study the relation between the…

Differential Geometry · Mathematics 2025-04-01 Gioacchino Antonelli , Marco Pozzetta

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

We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, $d \leq 1/\lambda^{2+o(1)}$) trade-off between (any desired) spectral expansion $\lambda$…

Data Structures and Algorithms · Computer Science 2024-10-23 Fernando Granha Jeronimo , Tushant Mittal , Sourya Roy , Avi Wigderson

We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…

Combinatorics · Mathematics 2025-04-22 Jun-Ting Hsieh , Alexander Lubotzky , Sidhanth Mohanty , Assaf Reiner , Rachel Yun Zhang

Expander graphs in general, and Ramanujan graphs in particular, have been of great interest in the last three decades with many applications in computer science, combinatorics and even pure mathematics. In these notes we describe various…

Combinatorics · Mathematics 2013-01-15 Alexander Lubotzky

Asymptotic dimension is a large-scale invariant of metric spaces that was introduced by Gromov (1993). We prove that every hereditary class of bounded-degree graphs that excludes some graph as a fat minor has asymptotic dimension at most…

Combinatorics · Mathematics 2025-08-11 Robert Hickingbotham

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