Related papers: A theory of semiprimitive groups

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

A transitive permutation group $G$ on a finite set $\Omega$ is said to be pre-primitive if every $G$-invariant partition of $\Omega$ is the orbit partition of a subgroup of $G$. It follows that pre-primitivity and quasiprimitivity are…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…

This paper classifies quasiprimitive permutation groups with a transitive subgroup which is isomorphic to $\A_n$ for some $n\geqslant5$.

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

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…

Semiuniform semigroups provide a natural setting for the convolution of generalized finite measures on semigroups. A semiuniform semigroup is said to be ambitable if each uniformly bounded uniformly equicontinuous set of functions on the…

In this paper, we classify finite quasiprimitive permutation groups with a metacyclic transitive subgroup, solving a problem initiated by Wielandt in 1949. It also involves the classification of factorizations of almost simple groups with a…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…

We investigate properties of finite transitive permutation groups $(G, \Omega)$ in which all proper subgroups of $G$ act intransitively on $\Omega.$ In particular, we are interested in reduction theorems for minimally transitive…

Elements $a,b$ of a semigroup $S$ are said to be \emph{primarily conjugate} or just \emph{p-conjugate}, if there exist $x,y\in S^1$ such that $a=xy$ and $b=yx$. The p-conjugacy relation generalizes conjugacy in groups, but for general…

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

A quasi-semiregular element in a permutation group is an element that has a unique fixed point and acts semiregularly on the remaining points. Such elements were first studied in the context of automorphisms of graphs and occur naturally in…