Related papers: On imprimitive rank 3 permutation groups

We consider models of random groups in which the typical group is of intermediate rank (in particular, it is not hyperbolic). These models are parallel to M. Gromov's well-known constructions and include for example a "density model" for…

We determine the group of reductive cohomological degree $3$ invariants of all split semisimple groups of types $B$, $C$, and $D$. We also present a complete description of the cohomological invariants. As an application, we show that the…

In earlier work we gave a characterisation of pregeometries which are `basic' (that is, admit no `non-degenerate' quotients) relative to two different kinds of quotient operations, namely imprimitive quotients and normal quotients. Each…

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…

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

This work completes the classification of the imprimitive irreducible modules, over algebraically closed fields of characteristic 0, of the finite quasisimple groups.

As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm PSL}_n(q)$ is prime. We…

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Let $\Gamma$ be a connected $G$-vertex-transitive graph, let $v$ be a vertex of $\Gamma$ and let $L=G_v^{\Gamma(v)}$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood $\Gamma(v)$. Then…

A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…

We construct elementary subgroups of all reductive groups of the local isotropic rank $\geq 2$ over rings and prove their basic properties. In particular, our results may be applied to the automorphism groups of any finitely generated…

In this article, we study $2$-designs with prime replication number admitting a flag-transitive automorphism group. The automorphism groups of these designs are point-primitive of almost simple or affine type. We determine $2$-designs with…

An action of a group $G$ on a set $X$ is said to be quasi-n-transitive if the diagonal action of $G$ on $X^n$ has only finitely many orbits. We show that branch groups, a special class of groups of automorphisms of rooted trees, cannot act…

This paper is about the structure of infinite primitive permutation groups and totally disconnected locally compact groups ("tdlc groups'"). The permutation groups we investigate are subdegree-finite (i.e. all orbits of point stabilisers…

This paper is a continuation of Almost Commutative Terwilliger Algebras of Group Association Schemes I: Classification [1]. In that paper, we found all groups G for which the Terwilliger algebra of the group association scheme, denoted T…

We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…

In this paper we analyze the structure of transitive permutation groups that have trivial four point stabilizers, but some nontrivial three point stabilizer. In particular we give a complete, detailed classification when the group is simple…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…