English
Related papers

Related papers: Cayley Graph Expanders and Groups of Finite Width

200 papers

Let $\Omega$ be a finite symmetric subset of GL$_n(\mathbb{Z}[1/q_0])$, and $\Gamma:=\langle \Omega \rangle$. Then the family of Cayley graphs $\{{\rm Cay}(\pi_m(\Gamma),\pi_m(\Omega))\}_m$ is a family of expanders as $m$ ranges over fixed…

Group Theory · Mathematics 2018-02-13 Alireza Salehi Golsefidy

We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric (genus and gonality) growth. Combining this general result with finiteness…

Number Theory · Mathematics 2019-12-19 Jordan Ellenberg , Chris Hall , Emmanuel Kowalski

Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an integer q, denote by Ga_q the subgroup of Ga consisting of the elements that project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q with…

Group Theory · Mathematics 2013-01-28 Alireza Salehi Golsefidy , Péter P. Varjú

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár

We construct a connected cubic nonnormal Cayley graph on $\mathrm{A}_{2^m-1}$ for each integer $m\geqslant4$ and determine its full automorphism group. This is the first infinite family of connected cubic nonnormal Cayley graphs on…

Combinatorics · Mathematics 2019-06-21 Jiyong Chen , Binzhou Xia , Jin-Xin Zhou

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

Group Theory · Mathematics 2025-07-22 Philip Easo , Tom Hutchcroft

We show that every non-trivial compact connected group and every non-trivial general or special linear group over an infinite field admits a generating set such that the associated Cayley graph has infinite diameter.

Group Theory · Mathematics 2019-01-30 Jakob Schneider

A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram…

Combinatorics · Mathematics 2021-04-23 F. Aguiló , M. A. Fiol , S. Pérez

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

We exhibit a finitely generated group $G$ and a sequence of finite index normal subgroups $N_n\trianglelefteq G$ such that for every finite generating subset $S\subseteq G$, the sequence of finite Cayley graphs $(G/N_n, S)$ does not…

Group Theory · Mathematics 2016-05-04 Goulnara Arzhantseva , Romain Tessera

In this paper, we study new Cayley graphs over the additive group of Galois rings. First we prove that they are expander graphs by using a Weil-Carlitz-Uchiyama type estimation of character sums for Galois rings. We also show that Cayley…

Combinatorics · Mathematics 2019-03-05 Shohei Satake

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 prove that if G is SL_2(F) or PSL_2(F), where F is a finite field, and A is a set of generators of G, then either |AAA| > |A|^(1+epsilon), where epsilon is an absolute positive real number, or AAA=G. As a corollary we get that the…

Group Theory · Mathematics 2010-10-08 Oren Dinai

Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph $C(G,S)$ is an expander graph and is non-bipartite then the spectrum of the adjacency operator $T$ is bounded away from $-1$. In this…

Group Theory · Mathematics 2019-06-20 Arindam Biswas

We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…

Combinatorics · Mathematics 2024-01-15 Martin Otto

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

Combinatorics · Mathematics 2016-07-12 Yan-Quan Feng , Klavdija Kutnar , Dragan Marusic , Da-Wei Yang

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Combinatorics · Mathematics 2015-06-10 Robert R. Lewis

We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…

Group Theory · Mathematics 2026-04-02 Sabine Chu , George Domat , Christine Gao , Ananya Prasanna , Alex Wright

We give an example of an infinite family of finite groups $G_n$ such that each $G_n$ can be generated by 2 elements and the diameter of every Cayley graph of $G_n$ is $O(\log (| G_{n}|))$. This answers a question of Lubotzky.

Group Theory · Mathematics 2007-05-23 Miklos Abert , Laszlo Babai

Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…

Combinatorics · Mathematics 2021-12-30 Ignacio García-Marco , Kolja Knauer