Related papers: Diameters of random Cayley graphs of finite nilpot…

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…

Given a finite group $G$, the difference graph of $G$, denoted by $\mathcal{D}(G)$, is the difference of the enhanced power graph of $G$ and the power graph of $G$, with all isolated vertices removed. This paper mainly studies the…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Word maps provide a wealth of information about finite groups. We examine the connection between the probability distribution induced by a word map and the underlying structure of a finite group. We show that a finite group is nilpotent if…

The directed Cayley diameter of a finite group is investigated in terms of the monoid of product-one sequences over the group, via the new notion of directed geodesic atoms. Two quantities associated to the set of directed geodesic atoms…

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.

Using methods of Marklof and Str\"ombergsson we establish several limit laws for metric parameters of random Cayley graphs of finite abelian groups with respect to a randomly chosen set of generators of a fixed size. Doing so we settle a…

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

Let $s$ be a positive integer. Our goal is to find all finite abelian groups $G$ that contain a $2$-subset $A$ for which the undirected Cayley graph $\Gamma(G,A)$ has diameter at most $s$. We provide a complete answer when $G$ is cyclic,…

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…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq q^C$. We show that the diameter of the resulting Cayley graph is bounded by $q^2 n^{O(1)}$ with probability…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…

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…

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…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

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…

Consider the Cayley graph of the cyclic group of prime order q with k uniformly chosen generators. For fixed k, we prove that the diameter of said graph is asymptotically (in q) of order q^(1/k). The same also holds when the generating set…