Related papers: Finite primitive groups and regular orbits of grou…
A finite non-regular primitive permutation group $G$ is extremely primitive if a point stabiliser acts primitively on each of its nontrivial orbits. Such groups have been studied for almost a century, finding various applications. The…
We are interested in semigroups of the form $\langle G,a\rangle\setminus G$, where $G$ is a permutation group of degree $n$ and $a$ a non-permutation on the domain of $G$. A theorem of the first author, Mitchell and Schneider shows that, if…
For a set $\Omega$ an unordered relation on $\Omega$ is a family R of subsets of $\Omega.$ If R is such a relation we let G(R) be the group of all permutations on $\Omega$ that preserves R, that is g belongs to G(R) if and only if x in R…
In 1988 Siemons and Wagner describe a relationship between the lengths of $G$-orbits on subsets of a $G$-set $\Omega$. They highlighted the situation where $\Delta \subset \Omega$ with $|\Delta|=k,$ and $|\Delta^G|>|\Sigma^G|$ for all…
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…
Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…
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 group $G$ of permutations of a set $\Omega$ is primitive if the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. If $\alpha \in \Omega$, then the orbits of the stabiliser $G_\alpha$…
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…
Given a finite group $G$ and a faithful irreducible $FG$-module $V$ where $F$ has prime order, does $G$ have a regular orbit on $V$? This problem is equivalent to determining which primitive permutation groups of affine type have a base of…
Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…
Let G be a permutation group, acting on a set \Omega of size n. A subset B of \Omega is a base for G if the pointwise stabilizer G_(B) is trivial. Let b(G) be the minimal size of a base for G. A subgroup G of Sym(n) is large base if there…
A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…
Given a finite group $G$ and a faithful irreducible $FG$-module $V$ where $F$ has prime order, does $G$ have a regular orbit on $V$? This problem is equivalent to determining which primitive permutation groups of affine type have a base of…
If $G$ is a group of permutations of a set $\Omega$ and $\alpha \in \Omega$, then the {\em $\alpha$-suborbits} of $G$ are the orbits of the stabilizer $G_\alpha$ on $\Omega$. The cardinality of an $\alpha$-suborbit is called a {\em…
To every involutive non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation on a finite set $X$ there is a naturally associated finite solvable permutation group ${\mathcal G}(X,r)$ acting on $X$. We prove that every…
If $G$ is a group acting on a set $\Omega$ and $\alpha, \beta \in \Omega$, the digraph whose vertex set is $\Omega$ and whose arc set is the orbit $(\alpha, \beta)^G$ is called an {\em orbital digraph} of $G$. Each orbit of the stabiliser…
Let $G$ be a finite permutation group acting on a set $\Omega$. An ordered sequence $(\omega_1,\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer of the sequence is trivial and no point…
This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…