SearcharxivSearch

arXiv subjects

Nick Gill

Publications and source records attributed to Nick Gill.

At least 19 recordsLinked to original sources

The binary actions of sporadic groups

An action of a group is binary if it induces the group of automorphisms of some homogeneous edge-coloured directed graph. In this paper we study the quasisimple groups $G$ with $G/Z(G)$ a sporadic simple group---we produce a complete classification of their binary actions.

math.GR

Non-orientable regular maps with negative prime-power Euler characteristic

In this paper we provide a classification of all regular maps on surfaces of Euler characteristic $-r^d$ for some odd prime $r$ and integer $d\ge 1$. Such maps are necessarily non-orientable, and the cases where $d = 1$ or $2$ have been dealt with previously. This classification splits naturally into three parts, based on the nature of the automorphism group $G$ of the map, and particularly the structure of its quotient $G/O(G)$ where $O(G)$ is the largest normal subgroup of $G$ of odd order. In fact $G/O(G)$ is isomorphic to either a $2$-group (in which case $G$ is soluble), or $\textrm{PSL}(2,q)$ or $\textrm{PGL}(2,q)$ where $q$ is an odd prime power. The result is a collection of $18$ non-empty families of regular maps, with conditions on the associated parameters.

math.GR

Initiating the proof of the Liebeck--Nikolov--Shalev conjecture

Liebeck, Nikolov, and Shalev conjectured that for every subset A of a finite simple group S with |A|>1, there exist O( log|S| / log|A| ) conjugates of A whose product is S. This paper is a companion to [Lifshitz: Completing the proof of the Liebeck-Nikolov-Shalev conjecture] and together they prove the conjecture. In this paper we prove the conjecture in the regime where $|A|>|S|^c$ for an absolute constant c>0. We also prove that the following Skew Product Theorem holds for all finite simple groups. Namely we show that either the product of two conjugates of A has size at least $|A|^{1.49}$, or S is the product of boundedly many conjugates of A.

math.GR

The binary actions of simple groups of Lie type of characteristic 2

Let $\mathcal{C}$ be a conjugacy class of involutions in a group $G$. We study the graph $\Gamma(\mathcal{C})$ whose vertices are elements of $\mathcal{C}$ with $g,h\in\mathcal{C}$ connected by an edge if and only if $gh\in\mathcal{C}$. For $t\in \mathcal{C}$, we define the component group of $t$ to be the subgroup of $G$ generated by all vertices in $\Gamma(\mathcal{C})$ that lie in the connected component of the graph that contains $t$. We classify the component groups of all involutions in simple groups of Lie type over a field of characteristic $2$. We use this classification to partially classify the transitive binary actions of the simple groups of Lie type over a field of characteristic $2$ for which a point stabilizer has even order. The classification is complete unless the simple group in question is a symplectic or unitary group.

math.GR

The binary actions of simple groups with a single conjugacy class of involutions

We continue our investigation of binary actions of simple groups. In this paper, we demonstrate a connection between the graph $\Gamma(\mathcal{C})$ based on the conjugacy class $\mathcal{C}$ of the group $G$, which was introduced in our previous work, and the notion of a strongly embedded subgroup of $G$. We exploit this connection to prove a result concerning the binary actions of finite simple groups that contain a single conjugacy class of involutions.

math.GR

The binary actions of alternating groups

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and either $gh^{-1}$ or $hg^{-1}$ is in $\mathcal{C}$. We prove a lemma that relates the binary actions of the group $G$ to connectivity properties of $\Gamma(\mathcal{C})$. This lemma allows us to give a complete classification of all binary actions when $G=A_n$, an alternating group on $n$ letters with $n\geq 5$.

math.GR

Irredundant bases for finite groups of Lie type

We prove that the maximum length of an irredundant base for a primitive action of a finite simple group of Lie type is bounded above by a function which is a polynomial in the rank of the group. We give examples to show that this type of upper bound is best possible.

math.GR

A generalization of Szep's conjecture for almost simple groups

We prove a natural generalization of Szep's conjecture. Given an almost simple group $G$ with socle not isomorphic to an orthogonal group having Witt defect zero, we classify all possible group elements $x,y\in G\setminus\{1\}$ with $G={\bf N}_G (\langle x\rangle){\bf N}_G(\langle y\rangle)$, where we are denoting by ${\bf N}_G(\langle x\rangle)$ and by ${\bf N}_G(\langle y\rangle)$ the normalizers of the cyclic subgroups $\langle x\rangle$ and $\langle y\rangle$. As a consequence of this result, we classify all possible group elements $x,y\in G\setminus\{1\}$ with $G={\bf C}_G(x){\bf C}_G(y)$.

math.GR

Cherlin's conjecture on finite primitive binary permutation groups

A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three known families. In this paper we complete the proof of this conjecture. To do this we study the case where the group $G$ is almost simple of Lie type.

math.GR

Statistics for $S_n$ acting on $k$-sets

We study the natural action of $S_n$ on the set of $k$-subsets of the set $\{1,\dots, n\}$ when $1\leq k \leq \frac{n}{2}$. For this action we calculate the maximum size of a minimal base, the height and the maximum length of an irredundant base. Here a "base" is a set with trivial pointwise stabilizer, "height" is the maximum size of a subset with the property that its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset, and an "irredundant base" can be thought of as a chain of (pointwise) set-stabilizers for which all containments are proper.

math.GR

Nilpotent covers of symmetric and alternating groups

We prove that the symmetric group $S_n$ has a unique minimal cover $\mathcal{M}$ by maximal nilpotent subgroups, and we obtain an explicit and easily computed formula for the order of $\mathcal{M}$. In addition, we prove that the order of $\mathcal{M}$ is equal to the order of a maximal non-nilpotent subset of $S_n$. This cover $\mathcal{M}$ has attractive properties; for instance, it is a normal cover, and the number of conjugacy classes of subgroups in the cover is equal to the number of partitions of $n$ into distinct positive integers. We show that these results contrast with those for the alternating group $A_n$. In particular, we prove that, for all but finitely many values of $n$, no minimal cover of $A_n$ by maximal nilpotent subgroups is a normal cover and the order of a minimal cover of $A_n$ by maximal nilpotent subgroups is strictly greater than the order of a maximal non-nilpotent subset of $A_n$.

math.GR

On the height and relational complexity of a finite permutation group

Let $G$ be a permutation group on a set $\Omega$ of size $t$. We say that $\Lambda\subseteq\Omega$ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda$. We define the height of $G$ to be the maximum size of an independent set, and we denote this quantity $\mathrm{H}(G)$. In this paper we study $\mathrm{H}(G)$ for the case when $G$ is primitive. Our main result asserts that either $\mathrm{H}(G)< 9\log t$, or else $G$ is in a particular well-studied family (the "primitive large--base groups"). An immediate corollary of this result is a characterization of primitive permutation groups with large "relational complexity", the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\mathrm{I}(G)$, the maximum length of an irredundant base of $G$, in which case we prove that if $G$ is primitive, then either $\mathrm{I}(G)<7\log t$ or else, again, $G$ is in a particular family (which includes the primitive large--base groups as well as some others).

math.GR

Groups Obtained from $2-(n,4,3)$ Supersimple Designs

We contribute towards the classification programme for Conway groupoids associated to a $2-(n,4,λ)$ design. Our main results improve the known bounds for a hole stabilizer to be primitive, or to contain the alternating group, ${\rm Alt}(n-1)$. We exploit these improved bounds to give a partial classification for Conway groupoids when $λ=3$.

math.GR

The character table of a sharply 5-transitive subgroup of ${\rm Alt}(12)$

In this paper we calculate the character table of a sharply $5$-transitive subgroup of ${\rm Alt}(12)$, and of a sharply $4$-transitive subgroup of ${\rm Alt}(11)$. Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu groups, and instead deduce the desired character tables using only the existence of the stated multiply transitive permutation representations.

math.GR

Cherlin's conjecture for almost simple groups of Lie rank 1

We prove Cherlin's conjecture, concerning binary primitive permutation groups, for those groups with socle isomorphic to $\mathrm{PSL}_2(q)$, ${^2\mathrm{B}_2}(q)$, ${^2\mathrm{G}_2}(q)$ or $\mathrm{PSU}_3(q)$. Our method uses the notion of a "strongly non-binary action".

math.GR