Related papers: Subdegree growth rates of infinite primitive permu…

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…

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence $(\omega_1\ldots,\omega_\ell)$ of elements of $\Omega$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of…

Let $G\leqslant {\rm Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser $H$. A base for $G$ is a subset of $\Omega$ whose pointwise stabiliser is trivial, and the minimal cardinality of a base is called the base…

Let $\Gamma$ be a finite connected graph and $G$ a vertex-transitive group of its automorphisms. The pair $(\Gamma, G)$ is said to be locally-$L$ if the permutation group induced by the action of the vertex-stabiliser $G_v$ on the set of…

Suppose that $G$ is a finite, transitive, solvable permutation group acting on a set $S$ with $n$ elements. Let $G_0$ be the stabilizer of a point $\alpha \in \Omega$. Define the rank of a permutation group, denoted $r(G),$ as the number of…

Let $G$ be a finite non-regular primitive permutation group on a set $\Omega$ with point stabiliser $G_{\alpha}$. Then $G$ is said to be extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus…

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…

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…

Let $G$ be a permutation group on a finite set $\Omega$. The base size of $G$ is the minimal size of a subset of $\Omega$ with trivial pointwise stabiliser in $G$. In this paper, we extend earlier work of Fawcett by determining the precise…

Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…

A subset $\mathcal{F}$ of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is intersecting if for any $g,h\in \mathcal{F}$ there exists $\omega \in \Omega$ such that $\omega^g = \omega^h$. The \emph{intersection density}…

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$. From the orbit counting lemma, it follows that $G$ contains a derangement,…

Let S=Sym(\Omega) be the group of all permutations of a countably infinite set \Omega, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if there exists a finite set U\subseteq S such that < G_1\cup U > = < G_2\cup U >. It is…

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 base B for a finite permutation group G acting on a set X is a subset of X with the property that only the identity of G can fix every point of B. We prove that a primitive diagonal group G has a base of size 2 unless the top group of G…

Let $\Omega$ be a finite set and $T(\Omega)$ be the full transformation monoid on $\Omega$. The rank of a transformation $t\in T(\Omega)$ is the natural number $|\Omega t|$. Given $A\subseteq T(\Omega)$, denote by $\langle A\rangle$ the…

In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a $G$-vertex-transitive graph $\Gamma$. In the main result the group $G$ is quasiprimitive or biquasiprimitive on the vertices of $\Gamma$, and we…

Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…

We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,Y^G) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title…

Grigorchuk's Overgroup $\tilde{\mathcal{G}}$, is a branch group of intermediate growth. It contains the first Grigorchuk's torsion group $\mathcal{G}$ of intermediate growth constructed in 1980, but also has elements of infinite order. It's…