A new flag-transitive linear space
We construct a new flag-transitive $2$-$(496,4,1)$ design with automorphism group $\mathrm{PΓL}_2(32)$. This corrects an omission in the classification of the finite flag-transitive linear spaces.
math.CO↗
arXiv subjects
Martin W. Liebeck
Publications and source records attributed to Martin W. Liebeck.
On a conjecture of Peter Neumann on fixed points in permutation groups
We prove a conjecture of Peter Neumann from 1966, predicting that every finite non-regular primitive permutation group of degree $n$ contains an element fixing at least one point and at most $n^{1/2}$ points. In fact, we prove a stronger version, where $n^{1/2}$ is replaced by $n^{1/3}$, and this is best possible. The case where $G$ is affine was proved by Guralnick and Malle; in this paper we address the case where $G$ is non-affine.
math.GR↗
Conjugacy in finite classical groups
Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of $x$ in $G$, by giving its group structure and a generating set. 3. Given $x,y \in G$, establish whether $x$ and $y$ are conjugate in $G$ and, if so, then find explicit $z \in G$ such that $z^{-1}xz = y$. We present comprehensive theoretical solutions to all three problems, and use our solutions to formulate practical algorithms. In parallel to our theoretical work, we have developed in Magma complete implementations of our algorithms. They form a critical component of various general algorithms in computational group theory - for example, computing character tables and solving conjugacy problems in arbitrary finite groups.
math.GR↗
Representations of extensions of simple groups
Feit and Tits (1978) proved that a nontrivial projective representation of minimal dimension of a finite extension of a finite nonabelian simple group $G$ factors through a projective representation of $G$, except for some groups of Lie type in characteristic 2; the exact exceptions for $G$ were determined by Kleidman and Liebeck (1989). We generalise this result in two ways. First we consider all low-dimensional projective representations, not just those of minimal dimension. Second we consider all characteristically simple groups, not just simple groups.
math.GR↗
Maps, simple groups, and arc-transitive graphs
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $Γ$ admitting an almost simple arc-transitive group $X$ of automorphisms, such that $Γ$ has a 2-cell embedding as a map on a closed surface admitting a core-free arc-transitive subgroup $G$ of $X$. We prove that apart from the case where $X$ and $G$ have socles $A_n$ and $A_{n-1}$ respectively, the only such graphs are the complete graphs $K_n$ with $n$ a prime power, the Johnson graphs $J(n,2)$ with $n-1$ a prime power, and 14 further graphs. In the exceptional case, we construct infinitely many graph embeddings.
math.GR↗
Involutions in finite simple groups as products of conjugates
Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $Γ_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded distance from the identity.
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 $Γ(\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 $Γ(\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↗
Multiplicity-free representations of algebraic groups II
We continue our work (started in ``Multiplicity-free representations of algebraic groups", arXiv:2101.04476), on the program of classifying triples $(X,Y,V)$, where $X,Y$ are simple algebraic groups over an algebraically closed field of characteristic zero with $X<Y$, and $V$ is an irreducible module for $Y$ such that the restriction $V\downarrow X$ is multiplicity-free. In this paper we handle the case where $X$ is of type $A$, and is irreducibly embedded in $Y$ of type $B,C$ or $D$. It turns out that there are relatively few triples for $X$ of arbitrary rank, but a number of interesting exceptional examples arise for small ranks.
math.RT↗
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↗
Multiplicity-free representations of algebraic groups
Let $K$ be an algebraically closed field of characteristic zero, and let $G$ be a connected reductive algebraic group over $K$. We address the problem of classifying triples $(G,H,V)$, where $H$ is a proper connected subgroup of $G$, and $V$ is a finite-dimensional irreducible $G$-module such that the restriction of $V$ to $H$ is multiplicity-free -- that is, each of its composition factors appears with multiplicity 1. A great deal of classical work, going back to Weyl, Dynkin, Howe, Stembridge and others, and also more recent work of the authors, can be set in this context. In this paper we determine all such triples in the case where $H$ and $G$ are both simple algebraic groups of type $A$, and $H$ is embedded irreducibly in $G$. While there are a number of interesting familes of such triples $(G,H,V)$, the possibilities for the highest weights of the representations defining the embeddings $H<G$ and $G<GL(V)$ are very restricted. For example, apart from two exceptional cases, both weights can only have support on at most two fundamental weights; and in many of the examples, one or other of the weights corresponds to the alternating or symmetric square of the natural module for either $G$ or $H$.
math.RT↗
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↗
Character ratios, representation varieties and random generation of finite groups of Lie type
We use character theory of finite groups of Lie type to establish new results on representation varieties of Fuchsian groups, and also on probabilistic generation of groups of Lie type.
math.GR↗
On the diameters of McKay graphs for finite simple groups
Let $G$ be a finite group, and $α$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,α)$ has the irreducible characters of $G$ as vertices, with an edge from $χ_1$ to $χ_2$ if $χ_2$ is a constituent of $αχ_1$. We study the diameters of McKay graphs for simple groups $G$. For $G$ a group of Lie type, we show that for any $α$, the diameter is bounded by a quadratic function of the rank, and obtain much stronger bounds for $G={\rm PSL}_n(q)$ or ${\rm PSU}_n(q)$. We also bound the diameter for symmetric and alternating groups.
math.GR↗
On the length and depth of finite groups (with an appendix by D.R. Heath-Brown)
An unrefinable chain of a finite group $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal subgroup of $G_{i-1}$. The length (respectively, depth) of $G$ is the maximal (respectively, minimal) length of such a chain. We studied the depth of finite simple groups in a previous paper, which included a classification of the simple groups of depth $3$. Here we go much further by determining the finite groups of depth $3$ and $4$. We also obtain several new results on the lengths of finite groups. For example, we classify the simple groups of length at most $9$, which extends earlier work of Janko and Harada from the 1960s, and we use this to describe the structure of arbitrary finite groups of small length. We also present a number-theoretic result of Heath-Brown, which implies that there are infinitely many non-abelian simple groups of length at most $9$. Finally we study the chain difference of $G$ (namely the length minus the depth). We obtain results on groups with chain difference $1$ and $2$, including a complete classification of the simple groups with chain difference $2$, extending earlier work of Brewster et al. We also derive a best possible lower bound on the chain ratio (the length divided by the depth) of simple groups, which yields an explicit linear bound on the length of $G/R(G)$ in terms of the chain difference of $G$, where $R(G)$ is the soluble radical of $G$.
math.GR↗
The length and depth of compact Lie groups
Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. In this paper, we introduce the notion of the length (respectively, depth) of $G$, defined as the maximal (respectively, minimal) length of such a chain, and we establish several new results for compact groups. In particular, we compute the exact length and depth of every compact simple Lie group, and draw conclusions for arbitrary connected compact Lie groups $G$. We obtain best possible bounds on the length of $G$ in terms of its dimension, and characterize the connected compact Lie groups that have equal length and depth. The latter result generalizes a well known theorem of Iwasawa for finite groups. More generally, we establish a best possible upper bound on $\dim G'$ in terms of the chain difference of $G$, which is its length minus its depth.
math.GR↗
Girth, words and diameter
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in terms of the length of w, which has additional applications. We also study the girth of random directed Cayley graphs of symmetric groups, and the relation between the girth and the diameter of random Cayley graphs of finite simple groups.
math.GR↗
Zero-one generation laws for finite simple groups
Let $G$ be a simple algebraic group over the algebraic closure of $GF(p)$ ($p$ prime), and let $G(q)$ denote a corresponding finite group of Lie type over $GF(q)$, where $q$ is a power of $p$. Let $X$ be an irreducible subvariety of $G^r$ for some $r\ge 2$. We prove a zero-one law for the probability that $G(q)$ is generated by a random $r$-tuple in $X(q) = X\cap G(q)^r$: the limit of this probability as $q$ increases (through values of $q$ for which $X$ is stable under the Frobenius morphism defining $G(q)$) is either 1 or 0. Indeed, to ensure that this limit is 1, one only needs $G(q)$ to be generated by an $r$-tuple in $X(q)$ for two sufficiently large values of $q$. We also prove a version of this result where the underlying characteristic is allowed to vary. In our main application, we apply these results to the case where $r=2$ and the irreducible subvariety $X = C\times D$, a product of two conjugacy classes of elements of finite order in $G$. This leads to new results on random $(2,3)$-generation of finite simple groups $G(q)$ of exceptional Lie type: provided $G(q)$ is not a Suzuki group, we show that the probability that a random involution and a random element of order 3 generate $G(q)$ tends to $1$ as $q \rightarrow \infty$. Combining this with previous results for classical groups, this shows that finite simple groups (apart from Suzuki groups and $PSp_4(q)$) are randomly $(2,3)$-generated. Our tools include algebraic geometry, representation theory of algebraic groups, and character theory of finite groups of Lie type.
math.GR↗
Tensor Product Markov Chains
We analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer Theorem for building irreducible representations, the McKay Correspondence, and Pitman's 2M-X Theorem. The chains are explicitly diagonalizable, and we use the eigenvalues/eigenvectors to give sharp rates of convergence for the associated random walks. For modular representations, the chains are not reversible, and the analytical details are surprisingly intricate. In the quantum group case, the chains fail to be diagonalizable, but a novel analysis using generalized eigenvectors proves successful.
math.RT↗