Related papers: The base size of a primitive diagonal group

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial…

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group and recall that an element in $G$ is a derangement if it has no fixed points on $\Omega$. Let $\Delta(G)$ be the set of derangements in $G$ and define $\delta(G) =…

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…

Let G be a primitive permutation group on a finite set Omega. Let p^2 divide |G|, for a prime p. We show that when G is solvable, there exists a subset of Omega whose stabilizer S has the property that 1<|S|_p<|G|_p. We offer a counting…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

We prove that if $G$ is a transitive permutation group of sufficiently large degree $n$, then either $G$ is primitive and Frobenius, or the proportion of derangements in $G$ is larger than $1/(2n^{1/2})$. This is sharp, generalizes…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

Let $G \leq \mathrm{GL}(V)$ be a group with a unique subnormal quasisimple subgroup $E(G)$ that acts absolutely irreducibly on $V$. A base for $G$ acting on $V$ is a set of vectors with trivial pointwise stabiliser in $G$. In this paper we…

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

Let $G$ be a non-abelian finite simple group. In addition, let $\Delta_G$ be the intersection graph of $G$, whose vertices are the proper nontrivial subgroups of $G$, with distinct subgroups joined by an edge if and only if they intersect…

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

We prove that if $G$ is a finite primitive permutation group and if $g$ is an element of $G$, then either $g$ has a cycle of length equal to its order, or for some $r$, $m$ and $k$, the group $G \leq \mathrm{Sym}(m) \textrm{wr}…

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…

Let $G$ be a finite 2-generated soluble group and suppose that $\langle a_1,b_1\rangle=\langle a_2,b_2\rangle=G$. If either $G^\prime$ is of odd order or $G^\prime$ is nilpotent, then there exists $b \in G$ with $\langle…