Bounds for the Diameters of Orbital Graphs of Affine Groups

General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point stabilizer H ≤GL(V ), where the vector space V has dimension d over the prime field, can be bounded in terms of d and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\log |V|/\log |H|$\end{document}log|V|/log|H| only. Several infinite families of affine primitive permutation groups with large orbital diameter are constructed. The results are independent from the classification of finite simple groups.


Introduction
Connections between finite permutation groups and graphs quite often allow one to express some abstract group-theoretic properties in combinatorial terms. One of the classical approaches is the study of orbital graphs of permutation groups. Recall that if G is a permutation group acting on a finite set X, then an orbital graph of G is a graph with vertex set X whose arc set is an orbit of G on X × X. An orbital graph whose arcs are a subset of the diagonal {(x, x) | x ∈ X} is called a diagonal orbital graph.
A transitive permutation group is called primitive if it has no nontrivial proper block of imprimitivity or, equivalently, if a point stabilizer is a maximal subgroup in the group. Primitive permutation groups can also be characterized in terms of their orbital graphs. By Dedicated to Pham Huu Tiep on the occasion of his 60th birthday.
Attila Maróti maroti@renyi.hu Saveliy V. Skresanov skresan@math.nsc.ru a criterion of Higman [11], a finite permutation group is primitive if and only if all its nondiagonal orbital graphs are connected. The degree of an orbital graph of a finite primitive permutation group is also of fundamental importance. By the Sims conjecture, resolved by Cameron, Praeger, Saxl and Seitz [7] (see also a simplified proof by Pyber and Tracey [18]) if some non-diagonal orbital graph of a finite primitive permutation group has degree bounded by d, then a point stabilizer of the group has size bounded in terms of d.
The subject of this paper is the diameter of an orbital graph of a finite primitive permutation group, or orbital diameter. Using model theory, Liebeck, Macpherson and Tent [15] described finite primitive permutation groups whose non-diagonal orbital graphs have bounded diameter (we note that in [15] orbital graphs are considered to be undirected), see also the papers of Sheikh [20] and Rekvényi [19]. The converse problem of finding upper bounds on the diameters of orbital graphs of primitive groups was also considered in [15], but in the case of affine groups only a partial result was obtained, see [15,Lemma 3.1].
Recall that a finite primitive permutation group G acting on a set X is called affine if it contains a nontrivial normal subgroup V which is elementary abelian (and regular as a permutation group). In this case a stabilizer H in G of a point in X acts linearly on V , viewed as a vector space over the prime field F p , where p is prime. Moreover V is a faithful and irreducible F p H -module and conversely, if V is a faithful and irreducible F p Hmodule for a finite group H , then the semidirect product H V may be viewed as an affine primitive permutation group with socle V . The main goal of this paper is to provide detailed upper bounds on the diameters of orbital graphs of affine primitive permutation groups, and complement the results of [15].
Another motivation is a problem of finding a n o (1) upper bound on diameters of orbital graphs of some classes of primitive permutation groups of degree n and, more generally, a bound on diameters of constituent graphs of primitive coherent configurations. See Pyber's paper [17] proving a logarithmic bound for distance-regular graphs and his conjecture in [14, p. 119]. We show that there exist several infinite families of affine primitive permutation groups of degree n = p d , where p is a prime, with orbital diameter at least (p − 1)d/4 (see Section 7). In particular, the n o(1) bound is not achievable for affine groups. We note that a weaker version of this was found earlier by Pyber (personal communication).
Our third motivation comes from additive combinatorics. Cochrane and Cipra [8, Theorem 1.2] proved the following result on the Waring problem in finite fields. Let A be a nontrivial multiplicative subgroup of F × , where F is a finite field, and assume that A generates F additively. Then n · A = F for every n ≥ 633 · |F | log 4 log |A| , where n · A denotes the sum of n copies of the set A (see Proposition 4.2 for a more precise statement), in particular, the diameter of a non-diagonal orbital graph of the affine primitive permutation group AF is bounded by n. Another goal of this paper is to present a generalization of this theorem (see Theorem 1.1).
The theorem of Cochrane and Cipra should be compared to the following results of Babai. Let r and p be primes such that r divides p − 1 and let H (p, r) be the unique nonabelian group of order pr. This group can be generated by two elements. Let diam min (H (p, r)) and diam max (H (p, r)) denote the minimum and, respectively, maximum diameter of a Cayley graph of H (p, r) over all possible pairs of generators. It was shown by Babai in an unpublished work that if r is bounded and p → ∞ then both diam min (H (p, r)) and diam max (H (p, r)) have the order of Θ(p 1/(r−1) ) (see [3,Theorem 6.1]). If r > p 1/2+c for some constant c > 0 then diam min (H (p, r)) = Θ(r 1/2 ) and diam max (H (p, r)) = Θ(r) (see [3,Theorem 6.2]). The second result is connected with the Waring problem in F p , see [3, Section 6] for details.
Another related result is a theorem of Peluse [16] on exponential sums over orbits of a linear group. It was shown that for every positive integer d and positive numbers δ, β there is a positive such that whenever H V is an affine primitive permutation group where H ≤ GL(V ) and V is a vector space of dimension d over F p and Δ is a nonzero orbit of H on V with (1) |Δ| ≥ p δ and (2) |Δ ∩ P | ≤ |Δ| 1−β for every hyperplane P in V , then the absolute value of an exponential sum over Δ is bounded by p − |Δ|. By Fourier analysis, this bound implies that the maximum diameter of a non-diagonal orbital graph of the affine primitive permutation group H V is bounded in terms of d, δ and β only. The third goal of the paper is to show that the maximum diameter of a non-diagonal orbital graph of an affine primitive permutation group is bounded in terms of d and δ provided that condition (1) holds (see Corollary 1.2).
To state our main result, let V be a faithful irreducible F p H -module for a finite group H , and let d be the dimension of V over F p . Denote by − − → diam(V , H ) the supremum of the diameters of non-diagonal orbital graphs of H V where graphs are considered to be oriented, and let diam(V , H ) be the supremum of diameters of non-diagonal orbital graphs where we forget about arc directions and consider graphs to be undirected. It follows from elementary diameter estimates (see Propositions 3.1 and 3.2) that Our main result may be considered an improvement of the previous upper bound on the diameter in the case when p is large. The function J (d) from the statement of (2) of Theorem 1.1 is precisely the function from the Larsen and Pink theorem, see Proposition 5.2, which is a classification-free version of Weisfeiler's theorem on the structure of linear groups [22,23]. We will show in Section 7 that there exist groups H of size bounded in terms of d with orbital graphs of large diameter, so the condition that |H | is larger than some constant depending on d is essential in (2) of Theorem 1.1.
In [15,Part (1) of Theorem 1.1] it was shown that if a class of affine primitive permutation groups has bounded orbital diameter, then this class consists of the so-called groups of t-bounded classical type, for some bounded t. It follows from the definition of groups of t-bounded classical type that an affine group H V with d = dim V is of t-bounded classical type for all t ≥ d, and therefore the conclusion of [ In Section 7 we will show that f (d) grows at least quasipolynomially. In order to prove Theorem 1.1 we establish the following technical result providing a more precise upper bound on the diameters of orbital graphs. Recall that a finite group is called a p -group if its order is not divisible by a prime p.
The proof of Theorem 1.3 relies on the result of Cochrane and Cipra [8, Theorem 1.2]. It should be mentioned that our results are free from the classification of finite simple groups. By utilizing the classification it is possible to give a good bound on the function J (d) (see, for example, the bounds in [23] or [9]) and improve the upper bounds in the case when the group contains a composition factor isomorphic to a finite simple group of Lie type in characteristic p, but these questions are out of scope of this paper.
The structure of the paper is as follows. In Section 2 we provide necessary preliminaries on additive properties of subsets and reformulate the problem of bounding diameters in those terms. In Section 3 we give elementary upper and lower bounds on the diameters, in particular, we provide an upper bound in terms of the intersection of the point stabilizer with the group of scalar matrices. Section 4 contains the proof of Theorem 1.3. In Section 5 we derive Theorem 1.1 from Theorem 1.3, and in Section 6 we derive Corollary 1.2. In Section 7 we provide examples of affine primitive permutation groups with large diameter, proving that some of our estimates are tight.
Let V be a finite abelian group, and let Δ, Γ be subsets of V . We define the sum, difference and negation of subsets as usual: For an integer n ≥ 1 let n · Δ denote the sum of n copies of Δ. The following proposition records several properties of subset sums, which will be used without further notice.

Proposition 2.1 Let V be a finite abelian group, and let
Proof If Δ is nonempty and x ∈ Δ, then for any Γ ⊆ V we have where the last inequality holds since (1) follows. Property (2) is a direct consequence of (1), and (3) is well-known for arbitrary finite groups.
Let G be a permutation group acting on a finite set X. An orbital graph for (X, G) is a graph with vertex set X whose arc set is an orbit of G on X × X; in general, this is a directed graph. An orbital graph with edge set contained in {(x, x) : x ∈ X} is called a diagonal orbital graph. The criterion of Higman [11] states that a permutation group G acting on X is primitive if and only if all non-diagonal orbital graphs are (strongly) connected, see [6, Theorems 1.9 and 1.10] for the proof.
Assume that G is an affine primitive permutation group with socle V . The group V is elementary abelian and acts regularly on X, so it can be identified with X in a natural way. Viewing V as a vector space of dimension d over the finite field F p the group G can be considered a subgroup of the affine general linear group AGL(V ). Therefore G decomposes as a semidirect product H V where H is the stabilizer of 0 ∈ V , and V is a faithful irreducible F p H -module.
In the case of an affine permutation group one can easily see that its orbital graphs are Cayley graphs of an abelian group V . Indeed, if Δ is an orbit of H on V , then the corresponding orbital graph has arc set {(x, y) ∈ V ×V | x −y ∈ Δ}, so Δ is the connection set. Notice that we obtain the diagonal orbital graph when Δ is the zero orbit. If It follows that the (directed) diameter of the corresponding orbital graph is equal to the minimal number n ≥ 1 such that or, in other words, to the minimal n ≥ 1 such that n · (Δ ∪ {0}) = V . Observe that such n always exists for a nonzero orbit Δ, since H acts irreducibly on V and therefore Δ spans V over F p . H ) the supremum of the diameters of non-diagonal orbital graphs of (X, G). Let Δ 1 , . . . , Δ r be all the nonzero orbits of H on V . Then

Denote by
If we forget about the arc direction of an orbital graph, we can consider its undirected diameter; let diam(V , H ) denote the supremum of the undirected diameters of non-diagonal orbital graphs of (X, G). If Δ is the connection set of some orbital graph, then the corresponding undirected graph has connection set Δ ∪ −Δ, in particular, we obtain the formula Clearly the orbits of the group The following lemma shows that if all elements of some nontrivial subspace lie at distance at most m from 0 in an orbital graph, then the whole orbital graph has diameter at most dm, where d is the dimension of V .
Proof Let u ∈ W be a nonzero vector. The orbit u H spans V over F p , so there exist elements , and the claim is proved.
By considering groups H −1 and A −1 we obtain an undirected version of the above

Elementary Diameter Estimates
Let H V ≤ AGL(V ) be an affine primitive permutation group where V is a vector space of dimension d over the prime field F p and H ≤ GL(V ). First we prove two general lower bounds for the diameter. We follow the proof of [4, Proposition 1.1] for our second lower bound, see also [1,Theorem 3]. . , x s }. Then every vector x ∈ V can be expressed as the sum x = k 1 x 1 + · · · + k s x s , where |k i | ≤ n. Therefore |V | ≤ (2n + 1) s , and the second result follows. H ), the provided bounds are also lower bounds for the directed diameter.
Let F × p denote the multiplicative group of the finite field F p , and recall that we can identify F × p with the center of GL(V ) in a natural way. The next result shows that the diameter is controlled by the intersection of the group H with F × p , essentially generalizing [15, Part (i) of Lemma 3.1].  1 ). Since non-diagonal orbital graphs of the trivial group acting on F p are directed cycles of length p, we obtain − − → diam(F p , 1 ) = p − 1 and the first displayed inequalities are proved. To prove the second part, recall that diam

Proposition 3.2 We have
. Finally, we have diam(F p , −1 ) = (p − 1)/2 for odd p, since orbital graphs of −1 acting on F p are undirected cycles of length p.
In Section 7 we will show that for all d and all odd p the inequalities on undirected diameter presented in Proposition 3.2 are sharp. Notice that the bound on undirected diameter does not apply when p = 2, as diam(F 2 , 1 ) = 1.

Proof of Theorem 1.3
In this section we prove Theorem 1.3 which is the main technical result required for the proof of Theorem 1.1.
Let H be an irreducible subgroup of GL(V ), where V has dimension d over the prime field F p , and let A be a nontrivial abelian p -subgroup of H . The vector space V is a completely reducible F p A-module by Maschke's theorem. We can write V = V 1 ⊕· · ·⊕V k , k ≤ d, where the V i are irreducible F p A-modules. Write |V i | = p f i , i = 1, . . . , k, for some integers f i . Let A i ≤ GL(V i ) be the group induced on V i by A. Since A is abelian, it induces a multiplicative group of a finite field on each V i , so we may assume that A i ≤ F × p f i for i = 1, . . . , k.
We have |A i | ≥ |A| 1/k for some i. Without loss of generality we may assume that for some j ≥ 1 we have |A i | ≥ |A| 1/k for i = 1, . . . , j, and |A i | < |A| 1/k for i = j +1, . . . , k. Nonzero orbits of A i on V i have size equal to |A i |, and in particular, for i = 1, . . . , j nonzero orbits of A i on V i have size at least |A| 1/k , while for i = j + 1, . . . , k orbit sizes are less than |A| 1/k .
If the subgroup A is normal in H , then all F p A-modules V i , i = 1, . . . , k, are isomorphic, in particular, j = k in this case.
Every vector v ∈ V can be uniquely written as

Lemma 4.1 Let v be a nonzero vector from V and set
then there exists w ∈ 2 s · Δ such that w ∈ V 1 ⊕ · · · ⊕ V k−s and w has a nonzero projection on V 1 .
Proof We will prove the statement by induction on s. Suppose that s = 0. Since Δ spans V , it cannot lie inside the proper subspace V 2 ⊕ · · · ⊕ V k . Therefore there exists a vector w ∈ 1 · Δ such that w has a nonzero projection on V 1 .
Suppose that s > 0, so, in particular, A is not normal in H . By the inductive hypothesis, there exists some vector u ∈ 2 s−1 · Δ lying in V 1 ⊕ · · · ⊕ V k−s+1 and having a nonzero projection on V 1 , that is, u = u 1 +· · ·+u k−s+1 where u i ∈ V i for every i = 1, . . . , k−s +1, and u 1 = 0. Recall that the length of the A-orbit of u k−s+1 is strictly smaller than |A| 1/k , in particular, it is smaller than the length of the A-orbit of u 1 . Therefore there exists some a ∈ A with u a 1 = u 1 and u a k−s+1 = u k−s+1 . The vector w = u−u a has a nonzero projection on V 1 and lies in V 1 ⊕ · · · ⊕ V k−s . It is left to notice that w ∈ 2 s−1 · Δ − 2 s−1 · Δ = 2 s · Δ, where the last equality follows from −Δ = Δ. The inductive argument is over.
We need the following result of Cochrane and Cipra. Recall that A induces a group A i on each V i , i = 1, . . . , j, and |A i | ≥ |A| 1/k . We Let v be an arbitrary vector from U = V 1 ⊕ · · · ⊕ V j . It has a unique decomposition of the form v = v 1 + · · · + v j , where v i ∈ V i , i = 1, . . . , j. Let l(v) denote the number of nonzero projections of v, i.e.
At least one of the vectors u + w or u + w is nonzero; without loss of generality, u + w = 0. Since u + w has zero projection on V i , we have l(u + w) < l(v). As

the inductive hypothesis gives
and the claim is proved.
Assume first that A is normal in H . In this case j = k and U = V . Each V i has equal size and |V i | k = |V |. Let v be an arbitrary nonzero vector in V . We have where the last inequality uses the facts that |A| ≥ 2 and k ≥ 1. The first part of Theorem 1.3 is proved.

Proof of Theorem 1.1
Recall that an element of a finite group is called a p -element if its order is not divisible by the prime p. The following lemma shows that finite simple groups of Lie type contain elements of large order. Proof Assume first that p ≥ 7. Let S be a finite simple group of Lie type in characteristic p. Let K be the corresponding universal version, and recall that S K/Z(K). By [10, Theorem 2.4.7 (d)], the Cartan subgroup of K contains a cyclic subgroup of order p−1, so let C be the image of that subgroup in S. Clearly C is a cyclic group of order not divisible by p, and |C| ≥ (p − 1)/|Z(K)|.
Unless S has type A l or 2 A l , [10, Table 2.2] gives us |Z(K)| ≤ 4, which proves the lemma in this case, since (p − 1)/4 ≥ p 1/5 . If S has type A l or 2 A l , then it has a p -element of order at least (p − 1)/2, see, for instance, [5,Corollary 3].
Assume that p ≤ 5. The order of S has at least three distinct prime divisors by Burnside's theorem. It follows that S must have a p -element of order at least 3 > 5 1/5 ≥ p 1/5 .
We need the following modular analogue of Jordan's theorem on linear groups. The original result was proved by Weisfeiler [22,23] with the use of the classification of finite simple groups, but we use a classification-free version due to Larsen and Pink. As a consequence of the above two results, we show that irreducible linear groups contain large abelian p -subgroups.  Proof Assume that H has a composition factor S isomorphic to a finite simple group of Lie type in characteristic p. The group S contains a p -element x of order at least p 1/5 . The preimage of x in H has order divisible by a number coprime to p and at least p 1/5 . This proves (1). Assume that H does not have a composition factor isomorphic to a finite simple group of Lie type in characteristic p. We use Proposition 5.2 and its notation. Since H acts irreducibly on the underlying module of dimension d over F p , the normal p-subgroup P of H is trivial by Clifford's theorem. We have E = B by assumption. Since B is an abelian normal psubgroup, we are finished if |B| ≥ |H | 1/2 . If |B| < |H | 1/2 , then |H | 1/2 < |H : B| ≤ J (d), contradicting our assumption |H | ≥ J (d) 2 . This proves (2).
We return to the proof of Theorem 1.1. Suppose that H contains a composition factor isomorphic to a finite simple group of Lie type in characteristic p. Then Corollary 5.3 (1) and Theorem 1.3 give us where A is an abelian p -subgroup of H with |A| ≥ p 1/5 . Thus where the last inequality holds for all d ≥ 2.
If H does not contain a composition factor isomorphic to a finite simple group of Lie type in characteristic p, and |H | ≥ J (d) 2 , then Corollary 5.3 (2) and Theorem 1.
where A is a normal abelian p -subgroup of H with |A| ≥ |H |

Affine Groups with Large Orbital Diameters
In this section we provide several series of groups with orbital graphs of large diameter. Let K be a nontrivial subgroup of F × p , where p is an odd prime. Let S be a transitive permutation group of degree d and let H = K S be a wreath product acting (linearly) imprimitively on V = F d p . By [21, Chapter IV, Section 15, Lemma 4], since p is odd and K is nontrivial, the group H acts irreducibly on V . If for any m ≥ 1 and hence Therefore we proved Clearly, diam(V , H ) = diam(F p , K −1 ) · d. By taking appropriate K it easily follows that the inequalities on undirected diameter presented in Proposition3.2 are sharp.
Let r ≥ 5 be an integer. In the second example H is the alternating group Alt(r) and p is an odd prime not dividing r. Let {v 1 , . . . , v r } be the basis of the natural permutation module of H over the field F p . This module has a proper submodule V which consists of vectors v = r i=1 λ i v i , where each λ i is an element of F p , such that r i=1 λ i = 0. The module V is irreducible by [12,Lemma 5.3.4] and has dimension d = r − 1 over F p . We will prove that diam(V , H ) Let m be the smallest positive integer such that m · (Δ ∪ {0}) = V . Since this is a lower bound for diam(V , H ) by Eq. (2), it is sufficient to show that m ≥ ((p − 1)/2) · d/2.
We prove the claim by induction on t = m(v). This is clear for t ≤ 1. Assume that t ≥ 2 and that the claim is true for ≤ f (d), as claimed. In our third example, let q and d be integers with q ≥ 2 and d ≥ 3. Zsigmondy's theorem [24] states that, provided (q, d) = (2, 6), there is a prime r dividing q d − 1 but not dividing q i − 1 for all i < d. Such a prime r is called a Zsigmondy prime and is denoted by q d . There may be several Zsigmondy primes q d for given d and q. It is easy to see that q d must be congruent to 1 modulo d. If d + 1 is prime then d + 1 is a Zsigmondy prime q d whenever the multiplicative order of q modulo d + 1 is d. For a given prime d + 1 there are infinitely many primes q with this property by Dirichlet's prime number theorem.
Let p and d be such that d + 1 is an odd Zsigmondy prime p d . Set V = F d p and let h be an element of GL(V ) of order d + 1. Since h is a cyclic group of order coprime to p, the F p h -module V is completely reducible by Maschke's theorem. Moreover, since the order of h is a Zsigmondy prime, V must be irreducible.
Let Δ be an orbit of h . It must have size d + 1 and it must contain a basis of V ; set Δ = {v 1 , . . . , v d , v}, where v 1 , . . . , v d are linearly independent. Since Δ is an orbit, h preserves the sum over all vectors in Δ: and as h acts irreducibly on V , this sum must be zero. Therefore v = − d j =1 v j . Let H be the cyclic group h −1 . By the previous paragraph every orbit Δ of H has the form {±v 1 } ∪ · · · ∪ {±v d } ∪ {±( d i=1 v i )} where {v 1 , . . . , v d } is a basis for V . Let be the smallest positive integer such that · (Δ ∪ {0}) = V . Since Δ = −Δ, this is equal to diam(V , H ) by Eq. 2. We proceed to show that (p − 1)d/4 ≤ ≤ (p − 1)(d + 1)/4, provided that p is odd.
Assume that p is odd. Let x, 0 = x 0 , x 1 , . . . , x d denote elements of F p where we will allow x, x 1 , . . . , x d to vary. For two elements f 1 and f 2 of F p let D(f 1 , f 2 ) be their distance defined to be the smallest integer m for which f 1 ∈ f 2 + m{±1, 0}. The smallest integer m for which the vector

It follows that
= max Funding Open access funding provided by ELKH Alfréd Rényi Institute of Mathematics.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.