Related papers: Finite semiprimitive permutation groups of rank $3…

The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the largest subdegree shares a non-trivial common factor with each…

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$. From the orbit counting lemma, it follows that $G$ contains a derangement,…

Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

We classify the finite primitive groups containing a permutation with at most four cycles (including fixed points) in its disjoint cycle representation.

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$ and recall that an element of $G$ is a derangement if it has no fixed points. Derangements always exist by a classical theorem of Jordan, but there are so-called…

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

A partial linear space is a point--line incidence structure such that each line is incident with at least two points and each pair of points is incident with at most one line. It is said to be proper if there exists at least one…

We study definably primitive pseudo-finite permutation groups of finite $SU$-rank. We show that if $(G,X)$ is such a permutation group, then the rank of $G$ can be bounded in terms of the rank of $X$, providing an analogue of a theorem of…

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…

While every group is isomorphic to a transitive group of permutations, the analogous property fails for inverse semigroups: not all inverse semigroups are isomorphic to transitive inverse semigroups of one-to-one partial transformations of…

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…

This is one of a series of papers which aims towards a classification of imprimitive affine groups of rank $3$. In this paper, a complete classification is given of such groups of characteristic $p$ such that the point stabilizer is not…

We classify all infinite primitive permutation groups possessing a finite point stabilizer, thus extending the seminal Aschbacher-O'Nan-Scott Theorem to all primitive permutation groups with finite point stabilizers.

Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

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…