• Corpus ID: 239009782

# On primitive $2$-closed permutation groups of rank at most four

@inproceedings{Giudici2021OnP,
title={On primitive \$2\$-closed permutation groups of rank at most four},
author={Michael Giudici and Luke Morgan and Jin-Xin Zhou},
year={2021}
}
• Published 15 October 2021
• Mathematics
We characterise the primitive 2-closed groups G of rank at most four that are not the automorphism group of a graph or digraph and show that if the degree is at least 2402 then there are just two infinite families or G 6 AΓL1(p ), the 1-dimensional affine semilinear group. These are the first known examples of non-regular 2-closed groups that are not the automorphism group of a graph or digraph.

## References

SHOWING 1-10 OF 45 REFERENCES
Digraph Representations of 2-closed Permutation Groups with a Normal Regular Cyclic Subgroup
• J. Xu
• Mathematics, Computer Science
Electron. J. Comb.
• 2015
2-closed permutation groups which contain a normal  regular cyclic subgroup and prove that for each such group $G$ there exists a circulant $\Gamma$ such that $\mathrm{Aut} (\Gamma)=G$.
Closures of Finite Primitive Permutation Groups
• Mathematics
• 1992
Let G be a primitive permutation group on a finite set ft, and, for k ^ 2, let G be the Ar-closure of G, that is, the largest subgroup of Sym (ft) preserving all the G-invariant ^-relations on ft.
The affine primitive permutation groups of degree less than 1000
• Mathematics, Computer Science
J. Symb. Comput.
• 2003
The classification of the primitive permutation groups of degree less than 1000 is complete by determining the irreducible subgroups of GL(n,p) for p prime and pn < 1000.
PRIMITIVE PERMUTATION GROUPS WITH A COMMON SUBORBIT, AND EDGE-TRANSITIVE GRAPHS
• Mathematics
• 2002
Dedicated to the memory of Helmut Wielandt In this paper a classification is obtained of all pairs G , H of finite primitive permutation groups such that G H , the socles of G and H are different,
Vertex-transitive tournaments of order a product of two distinct primes
Abstract In this paper, we begin a classification of the vertex-transitive tournaments of order pq where p and q are distinct odd primes. In particular we characterize the pq-circulant tournaments;
A NOTE ON PERMUTATION GROUPS AND THEIR REGULAR SUBGROUPS
• M. Xu
• Mathematics
Journal of the Australian Mathematical Society
• 2008
Abstract In this note we first prove that, for a positive integer n>1 with n≠p or p2 where p is a prime, there exists a transitive group of degree n without regular subgroups. Then we look at
Finite digraphs with given regular automorphism groups
With five exceptions, every finite regular permutation group occurs as the automorphism group of a digraph.One of the corollaries: given a finite groupG of ordern, there is a commutative semigroupS
The Automorphism Groups of Some Cubic Cayley Graphs
• C. Godsil
• Computer Science, Mathematics
Eur. J. Comb.
• 1983
The above necessary condition is sufficient when G is a 2-group generated by three elements of order two and constructed cubic Cayley graphs with automorphism groups isomorphic to the symmetric and alternating groups with degree at least 19.
A classification of the maximal subgroups of the finite alternating and symmetric groups
• Mathematics
• 1987
Following the classification of finite simple groups, one of the major problems in finite group theory today is the determination of the maximal subgroups of the almost simple groups-that is, of
The Affine Permutation Groups of Rank Three
(iii) G is an ajfine group, that is, the socle of G is a vector space V, where V s= {ZpY for some prime p and n=p ; moreover, if Go is the stabilizer of the zero vector in V then G = VG0, Go is an