Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
Michael Giudici, Gabriel Verret

TL;DR
This paper proves that all finite arc-transitive graphs with valency twice a prime have a nontrivial automorphism acting regularly on the vertices, supporting the broader Polycirculant Conjecture.
Contribution
It establishes the existence of semiregular automorphisms in a specific class of highly symmetric graphs, advancing the understanding of automorphism structures.
Findings
Every finite arc-transitive graph of valency twice a prime admits a semiregular automorphism.
Supports the Polycirculant Conjecture for a new class of graphs.
Provides structural insights into automorphisms of symmetric graphs.
Abstract
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant Conjecture, which states that all finite vertex-transitive digraphs admit such automorphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Arc-transitive graphs of valency twice a prime admit a semiregular automorphism
Michael Giudici
Michael Giudici, Department of Mathematics and Statistics
The University of Western Australia
35 Stirling Highway
Crawley
WA 6009
Australia
and
Gabriel Verret
Gabriel Verret, Department of Mathematics
The University of Auckland
Private Bag 92019
Auckland 1142
New Zealand
Abstract.
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant Conjecture, which states that all finite vertex-transitive digraphs admit such automorphisms.
1. Introduction
All graphs in this paper are finite. In 1981, Marušič asked if every vertex-transitive digraph admits a nontrivial semiregular automorphism [11], that is, an automorphism whose cycles all have the same length. This question has attracted considerable interest and a generalisation of the affirmative answer is now referred to as the Polycirculant Conjecture [3]. One line of investigation of this question has been according to the valency of the graph or digraph. Every vertex-transitive graph of valency at most four admits such an automorphism [5, 12], and so does every vertex-transitive digraph of out-valency at most three [7]. Every arc-transitive graph of prime valency has a nontrivial semiregular automorphism [8] and so does every arc-transitive graph of valency 8 [15]. Partial results were also obtained for arc-transitive graphs of valency a product of two primes [16]. We continue this theme by proving the following theorem.
Theorem 1.1**.**
Arc-transitive graphs of valency twice a prime admit a nontrivial semiregular automorphism.
2. Preliminaries
If is a group of automorphisms of a graph and is a vertex of , we denote by the stabiliser in of , by the neighbourhood of , and by the permutation group induced by on . We will need the following well-known results.
Lemma 2.1**.**
Let be a connected graph and such that all orbits of on have the same size. If a prime divides for some , then divides .
Lemma 2.2**.**
Let be a permutation group and let be a normal subgroup of such that acts faithfully on the set of -orbits. If has a semiregular element of order coprime to , then has a semiregular element of order .
Proof.
See for example [15, Lemma 2.3]. ∎
Lemma 2.3**.**
A transitive group of degree a power of a prime contains a semiregular element of order .
Proof.
In a transitive group of degree a power of a prime , every Sylow -subgroup is transitive. A non-trivial element of the center of this subgroup must be semiregular. ∎
Recall that a permutation group is quasiprimitive if every non-trivial normal subgroup is transitive, and biquasiprimitive if it is not quasiprimitive and every non-trivial normal subgroup has at most two orbits.
3. Arc-transitive graphs of prime valency
In the most difficult part of our proof, the arc-transitive graph of valency twice a prime will have a normal quotient with prime valency. We will thus need a lot of information about arc-transitive graphs of prime valency, which we collect in this section. We start with the following result, which is [2, Theorem 5]:
Theorem 3.1**.**
Let be a connected -arc-transitive graph of prime valency such that the action of on is either quasiprimitive or biquasiprimitive. Then one of the following holds:
- (1)
* contains a semiregular element of odd prime order;* 2. (2)
* is a power of ;* 3. (3)
, and ; 4. (4)
* and or , where is a Mersenne prime and , where is the product of the distinct prime divisors of ;* 5. (5)
* and , where and are as in part (4), and is the standard double cover of the graph given in (4).*
We note that in Cases (4) and (5), we must have , since this is the smallest Mersenne prime such that is not squarefree. This fact will be used at the end of Section 4.
Corollary 3.2**.**
Let be a connected -arc-transitive graph of prime valency. Then one of the following holds:
- (1)
* contains a semiregular element of odd prime order;* 2. (2)
* is a power of ;* 3. (3)
* contains a normal -subgroup such that is one of the graph-group pairs in (3–5) of Theorem 3.1.*
Proof.
Suppose that is not a power of and let be a normal subgroup of that is maximal subject to having at least three orbits on . In particular, is the kernel of the action of on the set of -orbits. Hence acts faithfully, and quasiprimitively or biquasiprimitively on . Since has prime valency and -arc-transitive, [10, Theorem 9] implies that is semiregular. We may thus assume that is a -group. (Otherwise contains a semiregular element of odd prime order.) If contains a semiregular element of odd prime order, then Lemma 2.2 implies that so does . We may assume that this is not the case. Similarly, we may assume that is not a power of . (Otherwise, is a power of .) It follows that and are as is (3–5) of Theorem 3.1. ∎
We will now prove some more results about the graphs that appear in (3–5) of Theorem 3.1. Let us first recall the notion of coset graphs. Let be a group with a subgroup and let such that but . The graph has vertices the right cosets of in , with two cosets and adjacent if and only if . Observe that the action of on the set of vertices by right multiplication induces an arc-transitive group of automorphisms such that is the stabiliser of a vertex. Moreover, every arc-transitive graph can be constructed in this way [14].
Lemma 3.3**.**
The graphs in (3) and (4) of Theorem 3.1 have a triangle.
Proof.
Clearly has a triangle so suppose that is one of the graphs given in (4). Since is quasiprimitive on and has prime valency, it follows that is arc-transitive on and so where , and such that is a union of distinct right cosets of .
Let . Note that acts 2-transitively on the set of right cosets of with the stabiliser of any two points being isomorphic to . Now the coset is fixed by and in particular has fixed points on . If , then the orbit of under has length and since , it follows that . Thus the points of that are not fixed by are permuted by in orbits of size and so for any we have that is a union of distinct right cosets of .
For each define the bijection of by . Since acts on by right multiplication, we see that commutes with each element of . Moreover, is nontrivial if and only if . Let . Since acts transitively on and centralises , it follows from [4, Theorem 4.2A] that acts semiregularly on . Now and . Since , the set of orbits of forms a system of imprimitivity for and hence for . Moreover, since is semiregular, comparing orders yields that has orbits. One of these orbits is the set of fixed points of and transitively permutes the remaining orbits of . In particular, it follows that transitively permutes the nontrivial orbits of and so the isomorphism type of does not depend on the choice of the double coset .
Let be the subgroup of scalar matrices in and let be the subgroup of the stabiliser in of the 1-dimensional subspace such that . Note that and let . In particular, letting and we have that and so we may assume that . Now and are both adjacent to and one can check that and so is a triangle in . ∎
Definition 3.4**.**
Let be a graph and let be a subset of . Let . If a vertex outside has at least two neighbours in , add to . Repeat this procedure until no more vertex outside have this property. If at the end of the procedure, we have , then we say that is dense with respect to .
Corollary 3.5**.**
Let be a graph in (3) or (4) of Theorem 3.1 and let be an edge of . Then is dense with respect to .
Proof.
Since is arc-transitive of prime valency , the local graph at (that is, the subgraph induced on ) is a vertex-transitive graph of order and thus vertex-primitive. By Lemma 3.3, has a triangle so the local graph has at least one edge and thus must be connected. It follows that, running the process described in Definition 3.4 starting at , eventually will contain all neighbours of . Repeating this argument and using connectedness of yields the desired conclusion. ∎
The following is immediate from Definition 3.4.
Lemma 3.6**.**
Let be a graph and be a set of vertices such that is dense with respect to . Then the standard double cover of , with vertex-set , is dense with respect to .
4. Proof of Theorem 1.1
Let be a prime, let be an arc-transitive graph of valency and let . We may assume that is connected. If is quasiprimitive or bi-quasiprimitive, then contains a nontrivial semiregular element, by [6, Theorem 1.1] and [8, Theorem 1.4]. We may thus assume that has a minimal normal subgroup such that has at least three orbits. In particular, has valency at least .
If is nonabelian, then has a nontrivial semiregular element by [16, Theorem 1.1]. We may therefore assume that is abelian and, in particular, is an elementary abelian -group for some prime .
We may also assume that is not semiregular that is, for some vertex . It follows from Lemma 2.1 that . As is -arc-transitive, we have that is transitive and so the orbits of all have the same size, either or . Since is a -group, this size is equal to . Writing for the valency of , we have that either or .
If and , then it follows from [13, Theorem ] that is isomorphic to a graph denoted by in [13]. By [13, Theorem ], contains the nontrivial semiregular automorphism defined in [13, Lemma ].
We may thus assume that and . In this case, if is adjacent to , then has exactly neighbours in . Let be the kernel of the action of on -orbits. By the previous observation, the orbits of have size and thus it is a -group. It follows from Lemma 2.1 that is a -group and thus so is .
Now, is an arc-transitive group of automorphisms of , so we may apply Corollary 3.2. If has a semiregular element of odd prime order, then so does , by Lemma 2.2. If is a power of , then so is and, in this case, contains a semiregular involution by Lemma 2.3. We may thus assume that we are in case (3) of Corollary 3.2, that is, contains a normal -subgroup such that is one of the graph-group pairs in (3–5) of Theorem 3.1. Note that is a -group. Let be a minimal normal subgroup of contained in the centre of . We may assume that is not semiregular hence and so by Lemma 2.1, . Moreover, as otherwise and we would deduce that fixes each element of , a contradicition. Since is central in , fixes every vertex in .
Note that the -conjugates of must cover , otherwise contains a nontrivial semiregular element. By the previous paragraph, the number of conjugates of is bounded above by the number of -orbits, that is , so we have
[TABLE]
Since is connected and -arc-transitive, there are no edges within -orbits. As , there exists such that and are distinct neighbours of . Let be the other neighbour of in . Since fixes every element of it follows that is also a neighbour of and and so is a 4-cycle in . Thus the graph induced between adjacent -orbits is a union of ’s.
If is a vertex and is a -orbit adjacent to , then there is a unique containing between and , and thus a unique vertex antipodal to in this . We say that is the buddy of with respect to . The set of buddies of is equal to , which is clearly fixed setwise by . Moreover, each vertex has the same number of buddies. Furthermore, since transitively permutes the set of -orbits adjacent to , either has a unique buddy or has exactly buddies.
If has a unique buddy , then , and so swapping every vertex with its unique buddy is a nontrivial semiregular automorphism. Thus it remains to consider the case where has buddies. We first prove the following.
Claim: If is a subgroup of that fixes pointwise both and , and is a -orbit adjacent to both and , then fixes pointwise.
Proof: Suppose that some does not fix . Now fixes pointwise, so must be the buddy of with respect to . Similarly, must be the buddy of with respect to . These are distinct, which is a contradiction. It follows that fixes and, since , also .
Let , let be an -arc of and let . Now , so and . Applying induction yields that
[TABLE]
We first assume that and are as in (3) or (4) of Theorem 3.1. Let be an edge of . By the previous paragraph, we have . Recall that fixes all vertices in , so fixes all vertices in . Combining the claim with Corollary 3.5 yields that and thus . It follows that so . On the other hand, is an irreducible -module over of dimension at least two. Since is nonabelian simple or has a nonabelian simple group as an index two subgroup, this implies that is a faithful irreducible -module over . If , then [9], contradicting . If or then by [1], . Recall that and so this contradicts .
Finally, we assume that is in (5) of Theorem 3.1, that is, is the standard double cover of a graph which appears in (4) of Theorem 3.1. In particular, . By Lemma 3.3, has a triangle, say . By Corollary 3.5 and Lemma 3.6, is dense with respect to . Now, let . Since contains , is dense with respect to . Note that is a -arc of . Let be a -arc of that projects to . Since is dense with respect to , arguing as in the last paragraph yields . On the other hand, if is the the initial vertex of , then by (1), we have and thus . Since it follows that . As above, is a faithful irreducible -module over of dimension at least two. Since we have from [1] that , which again contradicts .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Burkhardt, Die Zerlegungsmatrizen der Gruppen PSL ( 2 , p f ) PSL 2 superscript 𝑝 𝑓 {\rm PSL}(2,p^{f}) , J. Algebra 40 (1976), 75–96.
- 2[2] T. Burness and M. Giudici, Permutation groups and derangements of odd prime order, J. Combin. Theory Ser. A 151 (2017), 102–130.
- 3[3] P.J. Cameron, M. Giudici, G.A. Jones, W.M. Kantor, M.H. Klin, D. Marušič and L.A. Nowitz, Transitive permutation groups without semiregular subgroups, J. London Math. Soc. 66 (2002), 325–333.
- 4[4] J.D. Dixon and B. Mortimer, Permutation groups . Graduate Texts in Math., vol. 163. Springer-Verlag, New York, 1996.
- 5[5] E. Dobson, A. Malnič, D. Marušič and L.A. Nowitz, Semiregular automorphisms of vertex-transitive graphs of certain valencies, J. Combin. Theory Ser. B 97 (2007), 371–380.
- 6[6] M. Giudici, Quasiprimitive groups with no fixed point free elements of prime order, J. London Math. Soc. 67 (2003), 73–84.
- 7[7] M. Giudici, L. Morgan, P. Potočnik and G. Verret, Elusive groups of automorphisms of digraphs of small valency, European J. Combin. 46 (2015), 1–9.
- 8[8] M. Giudici and J. Xu, All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism, J. Algebraic Combin. 25 (2007), 217–232.
