arXiv subjects

Martyn Quick

Publications and source records attributed to Martyn Quick.

11 recordsLinked to original sources

arXiv2026

The probability of generating finite and profinite groups

Famously, every finite simple group $G$ can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate $G$ tends to $1$ as $|G| \to \infty$. In this paper, we generalize this theorem of Liebeck and Shalev. Work of Lucchini and Menegazzo (1997) implies that a finite group $G$ can be generated by a pair of elements if it has a unique chief series. As a consequence of our main theorem, the probability that a pair of elements generate such a group $G$ tends to $1$ as $|S| \to \infty$, where $S$ is the unique simple quotient of $G$. We also prove that a profinite group $G$ with finitely many chief series has a topological generating set of size $d < \infty$, and for any such $d$, the probability that a $d$-tuple of elements topologically generates $G$ is positive; moreover, we can take $d = 2$ if $G$ has a unique chief series. Along the way, we show that the chief factors of a finite group with a unique chief series are highly constrained, and we also analyze the maximal subgroup zeta function of a finite group with a unique minimal normal subgroup.

math.GR↗

arXiv2025

Generation of iterated wreath products constructed from alternating, symmetric and cyclic groups

Let $G_{1}$, $G_{2}$, ... be a sequence of groups each of which is either an alternating group, a symmetric group or a cyclic group and construct a sequence $(W_{i})$ of wreath products via $W_{1} = G_{1}$ and, for each $i \geq 1$, $W_{i+1} = G_{i+1} \operatorname{wr} G_{i}$ via the natural permutation action. We determine the minimum number $d(W_{i})$ of generators required for each wreath product in this sequence.

math.GR↗

arXiv2024

The Maximality of $T$ in Thompson's group $V$

We show that R. Thompson's group $T$ is a maximal subgroup of the group $V$. The argument provides examples of foundational calculations which arise when expressing elements of $V$ as products of transpositions of basic clopen sets in Cantor space $\mathfrak{C}$.

math.GR↗

arXiv2022

The structure of groups with all proper quotients virtually nilpotent

Just infinite groups play a significant role in profinite group theory. For each $c \geq 0$, we consider more generally JNN$_c$F profinite (or, in places, discrete) groups that are Fitting-free; these are the groups $G$ such that every proper quotient of $G$ is virtually class-$c$ nilpotent whereas $G$ itself is not, and additionally $G$ does not have any non-trivial abelian normal subgroup. When $c = 1$, we obtain the just non-(virtually abelian) groups without non-trivial abelian normal subgroups. Our first result is that a finitely generated profinite group is virtually class\nbd$c$ nilpotent if and only if there are only finitely many subgroups arising as the lower central series terms $\gamma_{c+1}(K)$ of open normal subgroups $K$ of $G$. Based on this we prove several structure theorems. For instance, we characterize the JNN$_c$F profinite groups in terms of subgroups of the above form $\gamma_{c+1}(K)$. We also give a description of JNN$_c$F profinite groups as suitable inverse limits of virtually nilpotent profinite groups. Analogous results are established for the family of hereditarily JNN$_c$F groups and, for instance, we show that a Fitting-free JNN$_c$F profinite (or discrete) group is hereditarily JNN$_cF$ if and only if every maximal subgroup of finite index is JNN$_c$F. Finally, we give a construction of hereditarily JNN$_c$F groups, which uses as an input known families of hereditarily just infinite groups.

math.GR↗

arXiv2022

Type systems and maximal subgroups of Thompson's group $V$

We introduce the concept of a type system~$\Part$, that is, a partition on the set of finite words over the alphabet~$\{0,1\}$ compatible with the partial action of Thompson's group~$V$, and associate a subgroup~$\Stab{V}{\Part}$ of~$V$. We classify the finite simple type systems and show that the stabilizers of various simple type systems, including all finite simple type systems, are maximal subgroups of~$V$. We also find an uncountable family of pairwise non-isomorphic maximal subgroups of~$V$. These maximal subgroups occur as stabilizers of infinite simple type systems and have not been described in previous literature: specifically, they do not arise as stabilizers in $V$ of finite sets of points in Cantor space. Finally, we show that two natural conditions on subgroups of $V$ (both related to primitivity) are each satisfied only by $V$ itself, giving new ways to recognise when a subgroup of $V$ is not actually proper.

math.GR↗

arXiv2021

On separability properties in direct products of semigroups

We investigate four finiteness conditions related to residual finiteness: complete separability, strong subsemigroup separability, weak subsemigroup separability and monogenic subsemigroup separability. For each of these properties we examine under which conditions the property is preserved under direct products. We also consider if any of the properties are inherited by the factors in a direct product. We give necessary and sufficient conditions for finite semigroups to preserve the properties of strong subsemigroup separability and monogenic subsemigroup separability in a direct product.

math.RA↗

arXiv2020

On separability finiteness conditions in semigroups

Taking residual finiteness as a starting point, we consider three related finiteness properties: weak subsemigroup separability, strong subsemigroup separability and complete separability. We investigate whether each of these properties is inherited by Sch\"utzenberger groups. The main result of this paper states that for a finitely generated commutative semigroup $S$, these three separability conditions coincide and are equivalent to every $\mathcal{H}$-class of $S$ being finite. We also provide examples to show that these properties in general differ for commutative semigroups and finitely generated semigroups. For a semigroup with finitely many $\mathcal{H}$-classes, we investigate whether it has one of these properties if and only if all its Sch\"utzenberger groups have the property.

math.GR↗

arXiv2019

Permutation-based presentations for Brin's higher-dimensional Thompson groups $nV$

The higher-dimensional Thompson groups $nV$, for $n \geq 2$, were introduced by Brin in 2005. We provide new presentations for each of these infinite simple groups. The first is an infinite presentation, analogous to the Coxeter presentation for the finite symmetric group, with generating set equal to the set of transpositions in $nV$ and reflecting the self-similar structure of $n$-dimensional Cantor space. We then exploit this infinite presentation to produce further finite presentations that are considerably smaller than those previously known.

math.GR↗

arXiv2016

Automorphism groups of linearly ordered structures and endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers

We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $\Omega$, there are uncountably many maximal subgroups of $\operatorname{End}(\mathbb{Q},{\leq})$ isomorphic to the automorphism group of $\Omega$. We characterise those subsets $X$ of $\mathbb{Q}$ that arise as a retract in $(\mathbb{Q},{\leq})$ in terms of topological information concerning $X$. Finally, we establish that a countable group arises as the automorphism group of a countable linearly ordered set, and hence as a maximal subgroup of $\operatorname{End}(\mathbb{Q},{\leq})$, if and only if it is free abelian of finite rank.

math.GR↗

arXiv2015

The infinite simple group V of Richard J. Thompson: presentations by permutations

We show that one can naturally describe elements of R. Thompson's finitely presented infinite simple group $V$, known by Thompson to have a presentation with four generators and fourteen relations, as products of permutations analogous to transpositions. This perspective provides an intuitive explanation towards the simplicity of $V$ and also perhaps indicates a reason as to why it was one of the first discovered infinite finitely presented simple groups: it is (in some basic sense) a relative of the finite alternating groups. We find a natural infinite presentation for $V$ as a group generated by these "transpositions," which presentation bears comparison with Dehornoy's infinite presentation and which enables us to develop two small presentations for $V$: a human-interpretable presentation with three generators and eight relations, and a Tietze-derived presentation with two generators and seven relations.

math.GR↗

arXiv2014

Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of the endomorphism monoid of $R$ isomorphic to the automorphism group of $\Gamma$. Further structural information about End $R$ is established including that Aut $\Gamma$ arises in uncountably many ways as a Sch\"{u}tzenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph.

math.CO↗