English
Related papers

Related papers: The directed Cayley diameter and the Davenport con…

200 papers

We address the degree-diameter problem for Cayley graphs of Abelian groups (Abelian graphs), both directed and undirected. The problem turns out to be closely related to the problem of finding efficient lattice coverings of Euclidean space…

Combinatorics · Mathematics 2021-02-09 Randall Dougherty , Vance Faber

A directed diameter of a directed graph is the maximum possible distance between a pair of vertices, where paths must respect edge orientations, while undirected diameter is the diameter of the undirected graph obtained by symmetrizing the…

Combinatorics · Mathematics 2025-03-04 Saveliy V. Skresanov

A well-known conjecture of Babai states that if $G$ is any finite simple group and $X$ is a generating set for $G$, then the diameter of the Cayley graph $Cay(G,X)$ is bounded by $\log|G|^c$ for some universal constant $c$. In this paper,…

Group Theory · Mathematics 2022-03-08 Martino Garonzi , Zoltán Halasi , Gábor Somlai

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

Group Theory · Mathematics 2026-04-21 Sean Eberhard , Elena Maini , Luca Sabatini , Gareth Tracey

When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…

Combinatorics · Mathematics 2017-01-06 Sébastien Martineau

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

Group Theory · Mathematics 2021-06-28 Luca Sabatini

Let $G$ be a finite abelian group and $D(G)$ denote the Davenport constant of $G$. We derive new upper bound for the Davenport constant for all groups of rank three. Our main result is that: $$D(C_{n_1}\oplus C_{n_2}\oplus C_{n_3})\le…

Group Theory · Mathematics 2019-10-25 Maciej Zakarczemny

Given a non-abelian finite simple group $G$ of Lie type, and an arbitrary generating set $S$, it is conjectured by Laszlo Babai that its Cayley graph $\Gamma (G,S)$ will have a diameter of $(\log |G|)^{O(1)}$. However, little progress has…

Group Theory · Mathematics 2017-11-29 Arindam Biswas , Yilong Yang

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$. Draw a vertex $U \sim \operatorname{Unif}(G)$. We show that the graph distance…

Probability · Mathematics 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

Let G be a Chevalley group scheme of rank l. We show that the following holds for some absolute constant d>0 and two functions p_0=p_0(l) and C=C(l,p). Let p>p_0 be a prime number and let G_n:=G(\Z/p^n\Z) be the family of finite groups for…

Group Theory · Mathematics 2012-01-24 Oren Dinai

So far, it has been proven that if $G$ is an abelian group , then the diameter of $G^n$ with respect to any generating set is $O(n)$; and if $G$ is nilpotent, symmetric or dihedral, then there exists a generating set of minimum size, for…

Group Theory · Mathematics 2023-02-09 A. Azad , N. Karimi

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Combinatorics · Mathematics 2025-10-03 Nyumbu Chishwashwa , Vance Faber , Noah Streib

Let $S\subset\text{GL}_n(\mathbb Z)$ be a finite symmetric set. We show that if the Zariski closure of $\Gamma=\langle S\rangle$ is a product of $\text{SL}_d$ or a special affine linear group, then the diameter of the Cayley graph…

Group Theory · Mathematics 2021-10-05 Lam Pham , Xin Zhang

Fix a prime $p$ and an integer $m$ with $p> m \geq 2$. Define the family of finite groups \[ G_n :=SL_m (\mathbb{Z}/p^{n}\mathbb{Z}) \] for $n=1,2,... $. We will prove that there exist two positive constants $C$ and $d$ such that for any…

Group Theory · Mathematics 2007-05-23 Oren Dinai

Following work of Rieffel, we define the Cayley compactification of an abelian group with specified generating set. We investigate its structure using methods from discrete geometry and commutative algebra.

Combinatorics · Mathematics 2007-05-23 Mike Develin

We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups $G_n$ with $|G_n| \to \infty$ admitting…

Group Theory · Mathematics 2026-02-17 Sean Eberhard , Luca Sabatini

Let $\Gamma=$Cay$(G,T)$ be a Cayley digraph over a finite Abelian group $G$ with respect the generating set $T\not\ni0$. $\Gamma$ has order ord$(\Gamma)=|G|=n$ and degree deg$(\Gamma)=|T|=d$. Let $k(\Gamma)$ be the diameter of $\Gamma$ and…

Combinatorics · Mathematics 2018-06-12 F. Aguiló , M. Zaragozá

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

Group Theory · Mathematics 2022-11-17 Azizollah Azad , Nasim Karimi

We show that every finitely generated group G with an element of order at least $(5rank(G))^{12}$ admits a locally finite directed Cayley graph with automorphism group equal to G. If moreover G is not generalized dihedral, then the above…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann , Mikael de la Salle