Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably primitive permutation group is definably isomorphic to an algebraic permutation group living in the constants. Applications include the verification, in differentially closed fields, of the finite Morley rank permutation group conjectures of Borovik-Deloro and Borovik-Cherlin. Applying the results to binding groups for internality to the constants, it is deduced that if complete types p and q are of rank m and n, respectively, and are nonorthogonal, then the $(m+3)$rd Morley power of p is not weakly orthogonal to the $(n+3)$rd Morley power of q. An application to transcendence of generic solutions of pairs of algebraic differential equations is given.

We construct a Borel maximal cofinitary group.

A first-order structure $\mathfrak {A}$ is called monadically stable iff every expansion of $\mathfrak {A}$ by unary predicates is stable. In this paper we give a classification of the class $\mathcal {M}$ of $\omega $-categorical monadically stable structure in terms of their automorphism groups. We prove in turn that $\mathcal {M}$ is the smallest class of structures which contains the one-element pure set, is closed under isomorphisms, and is closed under taking finite disjoint unions, infinite copies, and finite index first-order reducts. Using our classification we show that every structure in $\mathcal {M}$ is first-order interdefinable with a finitely bounded homogeneous structure. We also prove that every structure in $\mathcal {M}$ has finitely many reducts up to interdefinability, thereby confirming Thomas’ conjecture for the class $\mathcal {M}$.

In this paper, we wish to explore the role that textual representations play in the creation of new mathematical objects. We do so by analyzing texts by Joseph-Louis Lagrange (1736–1813) and Évariste Galois (1811–1832), which are seen as central to the historical development of the mathematical concept of groups. In our analysis, we consider how the material features of representations relate to the changes in conceptualization that we see in the texts.

Against this backdrop, we discuss the idea that new mathematical concepts, in general, are increasingly abstract in the sense of being detached from material configurations. Our analysis supports the opposite view. We suggest that changes in the material aspects of textual representations (i.e., the actual graphic inscriptions) play an active and crucial role in conceptual change.

We employ an analytical framework adapted from Bruno Latour’s 1999 account of intertwined material and representational practices in the empirical sciences. This approach facilitates a foregrounding of the interconnection between the conceptual development of mathematics, and the construction, (re-)configuration, and manipulation of the materiality of representations. Our analysis suggests that, in mathematical practice, distinctions between the material and structural features of representations are not permanent and absolute. This problematizes the appropriateness of the distinction between concrete inscriptions and abstract relations in understanding the development of mathematical concepts.

A group is $\frac 32$-generated if every non-trivial element is part of a generating pair. In 2019, Donoven and Harper showed that many Thompson groups are $\frac 32$-generated and posed five questions. The first of these is whether there exists a 2-generated group with every proper quotient cyclic that is not $\frac 32$-generated. This is a natural question given the significant work in proving that no finite group has this property, but we show that there is such an infinite group. The groups we consider are a family of finite index subgroups $G_1,\, G_2,\, \ldots$ of the Houghton group $\operatorname {FSym}(\mathbb {Z})\rtimes \mathbb {Z}$. We then show that $G_1$ and $G_2$ are $\frac 32$-generated and investigate the related notion of spread for these groups. We are able to show that they have finite spread at least 2. These are, therefore, the first infinite groups to be shown to have finite positive spread, and the first to be shown to have spread at least 2 (other than $\mathbb {Z}$ and the Tarski monsters, which have infinite spread). As a consequence, for each $k\in \{2,\, 3,\, \ldots \}$, we also have that $G_{2k}$ is index $k$ in $G_2$ but $G_2$ is $\frac 32$-generated whereas $G_{2k}$ is not.

If G is permutation group acting on a finite set $\Omega $ , then this action induces a natural action of G on the power set $\mathscr{P}(\Omega )$ . The number $s(G)$ of orbits in this action is an important parameter that has been used in bounding numbers of conjugacy classes in finite groups. In this context, $\inf ({\log _2 s(G)}/{\log _2 |G|})$ plays a role, but the precise value of this constant was unknown. We determine it where G runs over all permutation groups not containing any ${{\textrm {A}}}_l, l> 4$ , as a composition factor.

Let $G$ be a primitive permutation group of degree $n$ with nonabelian socle, and let $k(G)$ be the number of conjugacy classes of $G$. We prove that either $k(G)< n/2$ and $k(G)=o(n)$ as $n\rightarrow \infty$, or $G$ belongs to explicit families of examples.

In this paper, we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. These groups have recently been investigated in terms of their abstract structure, in a similar way to the O'Nan–Scott Theorem for primitive groups. Our goal here is to explore aspects of such groups which may be useful in place of precise structural information. We give bounds on the order, base size, minimal degree, fixed point ratio, and chief length of an arbitrary finite semiprimitive group in terms of its degree. To establish these bounds, we study the structure of a finite semiprimitive group that induces the alternating or symmetric group on the set of orbits of an intransitive minimal normal subgroup.

The work of L. G. (Laci) Kovács (1936–2013) gave us a deeper understanding of permutation groups, especially in the O’Nan–Scott theory of primitive groups. We review his contribution to this field.

We show that the permutation module over $ \mathbb{C} $ afforded by the action of ${\mathrm{Sp} }_{2m} ({2}^{f} )$ on its natural module is isomorphic to the permutation module over $ \mathbb{C} $ afforded by the action of ${\mathrm{Sp} }_{2m} ({2}^{f} )$ on the union of the right cosets of ${ \mathrm{O} }_{2m}^{+ } ({2}^{f} )$ and ${ \mathrm{O} }_{2m}^{- } ({2}^{f} )$.

We consider the wreath product of two permutation groups G≤Sym Γ and H≤Sym Δ as a permutation group acting on the set Π of functions from Δ to Γ. Such groups play an important role in the O’Nan–Scott theory of permutation groups and they also arise as automorphism groups of graph products and codes. Let X be a subgroup of Sym Γ≀Sym Δ. Our main result is that, in a suitable conjugate of X, the subgroup of SymΓ induced by a stabiliser of a coordinate δ∈Δ only depends on the orbit of δ under the induced action of X on Δ. Hence, if X is transitive on Δ, then X can be embedded into the wreath product of the permutation group induced by the stabiliser Xδ on Γ and the permutation group induced by X on Δ. We use this result to describe the case where X is intransitive on Δ and offer an application to error-correcting codes in Hamming graphs.

A transitive simple subgroup of a finite symmetric group is very rarely contained in a full wreath product in product action. All such simple permutation groups are determined in this paper. This remarkable conclusion is reached after a definition and detailed examination of ‘Cartesian decompositions’ of the permuted set, relating them to certain ‘Cartesian systems of subgroups’. These concepts, and the bijective connections between them, are explored in greater generality, with specific future applications in mind.

Willis's structure theory of totally disconnected locally compact groups is investigated in the context of permutation actions. This leads to new interpretations of the basic concepts in the theory and also to new proofs of the fundamental theorems and to several new results. The treatment of Willis's theory is self-contained and full proofs are given of all the fundamental results.