English
Related papers

Related papers: Higher index theory for certain expanders and Grom…

200 papers

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…

Combinatorics · Mathematics 2025-04-29 Uriya A. First , Tali Kaufman

We show that Gromov's monsters arising from i.i.d. random labellings of expanders (that we call random Gromov's monsters) have linear divergence along a subsequence, so that in particular they do not contain Morse quasigeodesics, and they…

Group Theory · Mathematics 2018-05-11 Dominik Gruber , Alessandro Sisto

The Geometric Shafarevich Conjecture and the Theorem of de Franchis state the finiteness of the number of certain holomorphic objects on closed or punctured Riemann surfaces. The analog of these kind of theorems for Riemann surfaces of…

Complex Variables · Mathematics 2023-12-20 Burglind Joricke

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

Group Theory · Mathematics 2021-03-10 Jacek Świątkowski

We implement new techniques involving Artin fans to study the realizability of tropical stable maps in superabundant combinatorial types. Our approach is to understand the skeleton of a fundamental object in logarithmic Gromov--Witten…

Algebraic Geometry · Mathematics 2017-06-27 Dhruv Ranganathan

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

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

Combinatorics · Mathematics 2015-02-03 Guy Moshkovitz , Asaf Shapira

We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For…

Group Theory · Mathematics 2022-08-25 Goulnara Arzhantseva , Arindam Biswas

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

In this paper, we use geometric tools to study the structure of asymptotic expanders and show that a sequence of asymptotic expanders always admits a "uniform exhaustion by expanders". It follows that asymptotic expanders cannot be coarsely…

Metric Geometry · Mathematics 2021-10-06 Ana Khukhro , Kang Li , Federico Vigolo , Jiawen Zhang

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Dynamical Systems · Mathematics 2025-09-10 Robert Bland , Kevin McGoff

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…

Combinatorics · Mathematics 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability of two vertices forming an edge depends on their geometric…

Social and Information Networks · Computer Science 2025-06-25 Marc Kaufmann , Johannes Lengler , Ulysse Schaller , Konstantin Sturm

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…

Number Theory · Mathematics 2013-03-12 Jordan S. Ellenberg

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

Combinatorics · Mathematics 2024-07-16 Brandon Du Preez

Given a gerbe $L$, on the holonomy groupoid $\mathcal G$ of the foliation $(M, \mathcal F)$, whose pull-back to $M$ is torsion, we construct a Connes $\Phi$-map from the twisted Dupont-Sullivan bicomplex of $\mathcal G$ to the cyclic…

K-Theory and Homology · Mathematics 2017-03-03 Moulay-Tahar Benameur , Alexander Gorokhovsky , Eric Leichtnam

In this paper we continue our investigation of the global categorical symmetries that arise when gauging finite higher groups and their higher subgroups with discrete torsion. The motivation is to provide a common perspective on the…

High Energy Physics - Theory · Physics 2024-08-28 Thomas Bartsch , Mathew Bullimore , Andrea E. V. Ferrari , Jamie Pearson

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 give a new proof of an index theorem for fiber bundles of compact topological manifolds due to Dwyer, Weiss, and Williams, which asserts that the parametrized $A$-theory characteristic of such a fiber bundle factors canonically through…

Algebraic Topology · Mathematics 2020-01-30 George Raptis , Wolfgang Steimle

This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph H.…

Combinatorics · Mathematics 2025-05-23 Igal Sason
‹ Prev 1 3 4 5 6 7 10 Next ›