English
Related papers

Related papers: Nilprogressions and groups with moderate growth

200 papers

We show that some classical results on expander graphs imply growth results on normal subsets in finite simple groups. As one application, it is shown that given a nontrivial normal subset $ A $ of a finite simple group $ G $ of Lie type of…

Group Theory · Mathematics 2024-06-19 Saveliy V. Skresanov

We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…

Group Theory · Mathematics 2008-09-10 Norbert Peyerimhoff , Alina Vdovina

The unipotent subgroup of a finite group of Lie type over a prime field Z/pZ comes equipped with a natural set of generators; the properties of the Cayley graph associated to this set of generators have been much studied. In the present…

Group Theory · Mathematics 2007-05-23 Jordan S. Ellenberg , Julianna S. Tymoczko

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

Group Theory · Mathematics 2023-07-28 Peter Keevash , Noam Lifshitz

In the first, mostly expository, part of this paper, a graded Lie algebra is associated to every group G given with an N-series of subgroups. The asymptotics of the Poincare series of this algebra give estimates on the growth of the group…

Group Theory · Mathematics 2009-11-27 Laurent Bartholdi , Rostislav I. Grigorchuk

Freiman's theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by…

Combinatorics · Mathematics 2010-02-22 Terence Tao

We present two results on expansion of Cayley graphs. The first result settles a conjecture made by DeVos and Mohar. Specifically, we prove that for any positive constant $c$ there exists a finite connected subset $A$ of the Cayley graph of…

Group Theory · Mathematics 2011-12-12 Martha Giannoudovardi

We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…

Combinatorics · Mathematics 2025-04-29 Arindam Biswas , Jyoti Prakash Saha

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

We define the notion of rough Cayley graph for compactly generated locally compact groups in terms of quasi-actions. We construct such a graph for any compactly generated locally compact group using quasi-lattices and show uniqueness up to…

Group Theory · Mathematics 2013-08-07 Pekka Salmi

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Group Theory · Mathematics 2007-05-23 Marc Lackenby

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

Metric Geometry · Mathematics 2024-10-29 Or Kalifa

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

Number Theory · Mathematics 2024-12-31 Lior Bary-Soroker , Noam Goldgraber

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Group Theory · Mathematics 2022-08-25 Sam Shepherd , Giles Gardam , Daniel J. Woodhouse

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

Group Theory · Mathematics 2017-10-03 Cheryl E. Praeger , Jacqui Ramagge , George Willis

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Combinatorics · Mathematics 2025-12-18 Carl Schildkraut

We show that every regular graph with good local expansion has a spanning Lipschitz subgraph with large girth and minimum degree. In particular, this gives a finite analogue of the dynamical solution to the von Neumann problem by Gaboriau…

Group Theory · Mathematics 2021-12-06 Gabor Kun

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…

Group Theory · Mathematics 2018-07-31 Daniel J. Woodhouse

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham