English
Related papers

Related papers: Isoperimetric Inequalities for Ramanujan Complexes…

200 papers

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

Geometric Topology · Mathematics 2015-07-07 Jason Behrstock , Cornelia Drutu

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

Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…

Geometric Topology · Mathematics 2023-04-03 Ivan Babenko , Florent Balacheff , Guillaume Bulteau

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias

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 consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

Mathematical Physics · Physics 2015-06-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

Let $G$ be a dense graph with good expansion properties and not too close to being bipartite. Let $\boldsymbol d$ be a graphical degree sequence. Under very weak conditions, we find the number of subgraphs of $G$ with degree sequence…

Combinatorics · Mathematics 2025-08-27 Mikhail Isaev , Brendan D. McKay

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

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…

Combinatorics · Mathematics 2015-09-15 Peter Keevash , Richard Mycroft

Recently, Rathie and K{\i}l{\i}\c{c}man (2014) employed Kummer-type transformation for $_{2}F_{2}(a, d+1; b, d; x)$ to develop certain classes of expansions theorems for $_{2}F_{2}(x)$ hypergeometric polynomial. Our aim is to deduce…

Classical Analysis and ODEs · Mathematics 2016-07-07 Yashoverdhan Vyas , Kalpana Fatawat

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

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…

Group Theory · Mathematics 2019-02-26 Trevor Davila

In this paper, we consider the class $\mathcal{C}^d$ of sphere intersection graphs in $\mathbb{R}^d$ for $d \geq 2$. We show that for each integer $t$, the class of all graphs in $\mathcal{C}^d$ that exclude $K_{t,t}$ as a subgraph has…

Combinatorics · Mathematics 2025-04-02 James Davies , Agelos Georgakopoulos , Meike Hatzel , Rose McCarty

Let $G= (V,E)$ be a finite graph. For $d_0>0$ we say that $G$ is $d_0$-regular, if every $v\in V$ has degree $d_0$. We say that $G$ is $(d_0, d_1)$-regular, for $0<d_1<d_0$, if $G$ is $d_0$ regular and for every $v\in V$, the subgraph…

Combinatorics · Mathematics 2023-08-28 Ehud Friedgut , Yonatan Iluz

Explicit representations of complex structures on closed manifolds are valuable, but relatively rare in the literature. Using isoparametric theory, we construct complex structures on isoparametric hypersurfaces with $g=4, m=1$ in the unit…

Differential Geometry · Mathematics 2025-02-14 Chao Qian , Zizhou Tang , Wenjiao Yan

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

Probability · Mathematics 2020-06-02 James R. Lee

We develop a real-analytic framework, called perplex analysis, in which the complex, split-complex, and dual numbers arise as members of a single four-parameter family of two-dimensional commutative real algebras. Within this unified…

Complex Variables · Mathematics 2025-12-17 Aurélio Menegon

We consider infinite conformal iterated function systems on $\mathbb{R}^d$. We study the geometric structure of the limit set of such systems. Suppose this limit set intersects some $l$-dimensional $C^1$-submanifold with positive Hausdorff…

Classical Analysis and ODEs · Mathematics 2017-01-31 Antti Käenmäki

We investigate the geometry of the graphs of nonseparating curves for surfaces of finite positive genus with potentially infinitely many punctures. This graph has infinite diameter and is known to be Gromov hyperbolic by work of the author.…

Geometric Topology · Mathematics 2020-08-07 Alexander J. Rasmussen

This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…

Dynamical Systems · Mathematics 2023-09-28 Rin Gotou