Let $G$ be a finite primitive permutation group on a set $Ω$ with nontrivial point stabilizer $G_α$. We say that $G$ is extremely primitive if $G_α$ acts primitively on each of its orbits in $Ω\setminus \{α\}$. In earlier work, Mann, Praeger and Seress have proved that every extremely primitive group is either almost simple or of affine type and they have classified the affine groups up to the possibility of at most finitely many exceptions. More recently, the almost simple extremely primitive groups have been completely determined. If one assumes Wall's conjecture on the number of maximal subgroups of almost simple groups, then the results of Mann et al. show that it just remains to eliminate an explicit list of affine groups in order to complete the classification of the extremely primitive groups. Mann et al. have conjectured that none of these affine candidates are extremely primitive and our main result confirms this conjecture.
Let $G$ be a finite primitive permutation group on a set $Ω$ with nontrivial point stabilizer $G_α$. We say that $G$ is extremely primitive if $G_α$ acts primitively on each of its orbits in $Ω\setminus \{α\}$. These groups arise naturally in several different contexts and their study can be traced back to work of Manning in the 1920s. In this paper, we determine the almost simple extremely primitive groups with socle an exceptional group of Lie type. By combining this result with earlier work of Burness, Praeger and Seress, this completes the classification of the almost simple extremely prim…
Let $G$ be a finite non-regular primitive permutation group on a set $Ω$ with point stabiliser $G_α$. Then $G$ is said to be extremely primitive if $G_α$ acts primitively on each of its orbits in $Ω\setminus \{α\}$, which is a notion dating back to work of Manning in the 1920s. By a theorem of Mann, Praeger and Seress, it is known that every extremely primitive group is either almost simple or affine, and all the almost simple examples have subsequently been determined. Similarly, Mann et al. have classified all of the affine extremely primitive groups up to a finite, but undetermined, collect…
A finite non-regular primitive permutation group $G$ is extremely primitive if a point stabiliser acts primitively on each of its nontrivial orbits. Such groups have been studied for almost a century, finding various applications. The classification of extremely primitive groups was recently completed by Burness and Lee, who relied on an earlier classification of soluble extremely primitive groups by Mann, Praeger and Seress. Unfortunately, there is an inaccuracy in the latter classification. We correct this mistake, and also investigate regular linear spaces which admit groups of automorphism…
Let $G$ be a permutation group on a set $Ω$. A base for $G$ is a subset of $Ω$ whose pointwise stabiliser is trivial, and the base size of $G$ is the minimal cardinality of a base. If $G$ has base size $2$, then the corresponding Saxl graph $Σ(G)$ has vertex set $Ω$ and two vertices are adjacent if they form a base for $G$. A recent conjecture of Burness and Giudici states that if $G$ is a finite primitive permutation group with base size $2$, then $Σ(G)$ has the property that every two vertices have a common neighbour. We investigate this conjecture when $G$ is an affine group and a point sta…
Let V be a d-dimensional vector space over a field of prime order p. We classify the affine transformations of V of order at least p^d/4, and apply this classification to determine the finite primitive permutation groups of affine type, and of degree n, that contain a permutation of order at least n/4. Using this result we obtain a classification of finite primitive permutation groups of affine type containing a permutation with at most four cycles.
For a finite group $G$, the Hurwitz space $\mathcal{H}^{in}_{r,g}(G)$ is the space of genus $g$ covers of the Riemann sphere with $r$ branch points and the monodromy group $G$. In this paper, we give a complete list of primitive genus one systems of affine type. That is, we assume that $G$ is a primitive group of affine type. Under this assumption we determine the braid orbits on the suitable Nielsen classes, which is equivalent to finding connected components in $\mathcal{H}^{in}_{r,1}(G)$. Furthermore, we give a new algorithm for computing large braid orbits on Nielsen classes. This algorith…
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 \leq \mathrm{GL}(V) $, where the vector space $ V $ has dimension $ d $ over the prime field, can be bounded in terms of $ d $ and $ \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.
Motivated by questions arising in connection with branched coverings of connected smooth projective curves over finite fields, we study the proportion of fixed point free elements (derangements) in cosets of normal subgroups of primitive permutations groups. Using the Aschbacher-O'Nan-Scott theorem for primitive groups to partition the problem, we provide complete answers for affine groups and groups which contain a regular normal nonabelian subgroup.
A partial linear space is a pair $(\mathcal{P},\mathcal{L})$ where $\mathcal{P}$ is a non-empty set of points and $\mathcal{L}$ is a collection of subsets of $\mathcal{P}$ called lines such that any two distinct points are contained in at most one line, and every line contains at least two points. A partial linear space is proper when it is not a linear space or a graph. A group of automorphisms $G$ of a proper partial linear space acts transitively on ordered pairs of distinct collinear points and ordered pairs of distinct non-collinear points precisely when $G$ is transitive of rank 3 on poi…
We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy group is a primitive affine permutation group.
Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation groups with the extremal property that the order of every derangement is an $r$-power, for some fixed prime $r$. First we show that these groups are either almost simple or affine, and we determine all the almost simple groups with this property. We also prove that an affine group $G$ has this property if and only if every two-point stabilizer is an $r$-grou…
Every synchronising permutation group is primitive and of one of three types: affine, almost simple, or diagonal. We exhibit the first known example of a synchronising diagonal type group. More precisely, we show that $\mathrm{PSL}(2,q)\times \mathrm{PSL}(2,q)$ acting in its diagonal action on $\mathrm{PSL}(2,q)$ is separating, and hence synchronising, for $q=13$ and $q=17$. Furthermore, we show that such groups are non-spreading for all prime powers $q$.
The purpose of this note is to extend the classical Aschbacher--O'Nan--Scott theorem for finite groups to the class of countable linear groups. This relies on the analysis of primitive actions carried out in a previous paper. Unlike the situation for finite groups, we show here that the number of primitive actions depends on the type: linear groups of almost simple type admit infinitely (and in fact unaccountably) many primitive actions, while affine and diagonal groups admit only one. The abundance of primitive permutation representations is particularly interesting for rigid groups such as s…
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is primitive. The remaining generators ensure transitivity or comply with specific features of the group. We show that, other than the symmetric and alternating groups, there are infinitely many primitive groups with one primitive generator each. These primitive groups are certain Mathieu groups, certain projective general and projective special linear groups, and…
We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show that all such almost simple groups, namely all but a few groups ${\rm PSL}_2(q)$, ${\rm PGL}_2(q)$ and ${\rm Sz}(q)$, arise from regular maps, which are always non-orientable. In the affine case, the maps $\mathcal M$ occur in orientable and non-orientable Petrie dual pairs. We give the number of maps associated with each group, together with their genus and …
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of the theory of permutation groups. However, this is another instance of a situation common in mathematics in which a very natural problem turns out to be extremely difficult. Fortunately, the enormous progresses of the last few decades seem to allow a new momentum on the attack to this problem. In this paper we prove that there are infinite families of primiti…
We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer $G_α$ is nontrivial and its orbits distinct from $\{α\}$ are of the same size. We prove that $d(G)\leq4$ for every primitive $\frac{3}{2}$-transitive permutation group $G$, moreover, $G$ is $2$-generated except for the very particular solvable affine groups that we completely describe. In particular, all finite $2$-transitive and $2$-homogeneous groups are $2$-gener…
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\leqslant \mathrm{A}Γ\mathrm{L}_1(p^d)$, 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.
The Hall--Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylow subgroups are not cyclic. The conjecture is now proved, and one aim of this paper is to document the final step in the proof (for the sporadic simple group $\mathrm{J}_4$). We apply this result to prove that primitive permutation groups of simple diagonal type with three or more simple factors in the socle are non-synchronizing. We also give the simpler proof that, for groups of affine type, or simple diagonal type with two socle factors, synchronization and separation are equivalent. Synchro…
Let $G$ be a group of collineations of a finite thick generalised quadrangle $Γ$. Suppose that $G$ acts primitively on the point set $\mathcal{P}$ of $Γ$, and transitively on the lines of $Γ$. We show that the primitive action of $G$ on $\mathcal{P}$ cannot be of holomorph simple or holomorph compound type. In joint work with Glasby, we have previously classified the examples $Γ$ for which the action of $G$ on $\mathcal{P}$ is of affine type. The problem of classifying generalised quadrangles with a point-primitive, line-transitive collineation group is therefore reduced to the case where ther…
Let $G$ be a finite permutation group on $Ω$. An ordered sequence of elements of $Ω$, $(ω_1,\dots, ω_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(ω_1,\dots, ω_t)}$ is trivial and no point is fixed by the stabilizer of its predecessors. If all irredundant bases of $G$ have the same size we say that $G$ is an IBIS group. In this paper we show that if a primitive permutation group is IBIS, then it must be almost simple, of affine-type, or of diagonal type. Moreover we prove that a diagonal-type primitive permutation groups is IBIS if and only if it is isomorphic to $PSL(2,…
We classify the dessins $\mathcal D$ for which the automorphism group $G$ acts primitively and faithfully on the points over one of the three critical values (without loss of generality the black vertices in the usual bipartite map representation). We show that they are all generalised Paley dessins, in which the black vertices are the elements of a finite field ${\mathbb F}_q$, and $G$ is a subgroup of the affine group ${\rm AGL}_1(q)$. Using earlier results obtained with Streit and Wolfart, we determine the orbits of the absolute Galois group on these dessins, we show that they are all defin…
Let $G$ be a permutation group on a finite set $Ω$. A subset $B \subseteq Ω$ is a base for $G$ if the pointwise stabilizer of $B$ in $G$ is trivial. The base size of $G$, denoted $b(G)$, is the smallest size of a base. A well known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant $c$ such that $b(G) \le c\log |G| / \log n$ for any primitive permutation group $G$ of degree $n$. Some special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups…
Fix a positive integer $d$ and let $Γ_d$ be the class of finite groups without sections isomorphic to the alternating group $A_d$. The groups in $Γ_d$ were studied by Babai, Cameron and Pálfy in the 1980s and they determined bounds on the order of a primitive permutation group with this property, which have found a wide range of applications. Subsequently, results on the base sizes of such groups were also obtained. In this paper we replace the structural conditions on the group by restrictions on its point stabilizers, and we obtain similar, and sometimes stronger conclusions. For example, we…
A permutation group $(X,G)$ is said to be binary, or of relational complexity $2$, if for all $n$, the orbits of $G$ (acting diagonally) on $X^2$ determine the orbits of $G$ on $X^n$ in the following sense: for all $\bar{x},\bar{y} \in X^n$, $\bar{x}$ and $\bar{y}$ are $G$-conjugate if and only if every pair of entries from $\bar{x}$ is $G$-conjugate to the corresponding pair from $\bar{y}$. Cherlin has conjectured that the only finite primitive binary permutation groups are $S_n$, groups of prime order, and affine orthogonal groups $V\rtimes O(V)$ where $V$ is a vector space equipped with an …
In this article, we study $2$-designs with prime replication number admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine $2$-designs with prime replication number admitting an almost simple automorphism group.
We classify the finite primitive permutation groups which have a cyclic subgroup with two orbits. This extends classical topics in permutation group theory, and has arithmetic consequences. By a theorem of C. L. Siegel, affine algebraic curves with infinitely many integral points are parametrized by rational functions whose monodromy groups have this property. We classify the possibilities of these monodromy groups, and give an application to Hilbert's irreducibility theorem.
