Related papers: Separating subsets from their images
The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is the graph $\Gamma(G)$ whose vertices are the prime divisors of $|G|$, and whose edges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A finite…
An element $x$ of a group $G$ is a commutator if it can be expressed in the form $x = a^{-1}b^{-1}ab$ for some $a, b \in G$. In 2010 MacHale posed the following problem in the Kourovka notebook: does there exist a finite group $G$, with…
For a finite group $G$, denote by $\alpha(G)$ the minimum number of vertices of any graph $\Gamma$ having $\text{Aut}(\Gamma)\cong G$. In this paper, we prove that $\alpha(G)\leq |G|$, with specified exceptions. The exceptions include four…
The Markoff group of transformations is a group $\Gamma$ of affine integral morphisms, which is known to act transitively on the set of all positive integer solutions to the equation $x^{2}+y^{2}+z^{2}=xyz$. The fundamental strong…
For a finite abelian group $G$, the Erd\H{o}s-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length…
We study the right and left commutation semigroups of finite metacyclic groups with trivial centre. These are presented \[G(m,n,k) = \left\langle {a,b;{a^m} = 1,{b^n} = 1,{a^b} = {a^k}} \right\rangle \quad (m,n,k\in\mathbb{Z}^+)\] with…
Given a permutation group $G$ on a finite set $\Omega$, let $G^{(k)}$ denote the $k$-closure of $G$, that is, the largest permutation group on $\Omega$ having the same orbits in the induced action on $\Omega^k$ as $G$. Recall that a group…
Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…
A permutation group $G$ on a set $A$ is ${\kappa}$-homogeneous iff for all $X,Y\in [A]^{\kappa}$ with $|A\setminus X|=|A\setminus Y|=|A|$ there is a $g\in G$ with $g[X]=Y$. $G$ is ${\kappa}$-transitive iff for any injective function $f$…
For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…
For a finite group $G$ we investigate the smallest positive integer $e(G)$ such that the map sending $g\in G$ to $e(G)|G:C_G(g)|$ is a generalized character of $G$. It turns out that $e(G)$ is strongly influenced by local data, but behaves…
The transitivity degree of a group $G$ is the supremum of all integers $k$ such that $G$ admits a faithful $k$-transitive action. Few obstructions are known to impose an upper bound on the transitivity degree for infinite groups. The…
We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…
Given a finite transitive permutation group $G\leq \operatorname{Sym}(\Omega)$, with $|\Omega|\geq 2$, the derangement graph $\Gamma_G$ of $G$ is the Cayley graph $\operatorname{Cay}(G,\operatorname{Der}(G))$, where $\operatorname{Der}(G)$…
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…
Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…
We study pairs $(\Gamma,G)$, where $\Gamma$ is a 'Buekenhout-Tits' pregeometry with all rank 2 truncations connected, and $G\leqslant\mathrm{Aut} \Gamma$ is transitive on the set of elements of each type. The family of such pairs is closed…
The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the largest subdegree shares a non-trivial common factor with each…
It is proved in [21] that there is a constant $c$ such that each transitive permutation group of degree $d\ge 2$ can be generated by $\lfloor cd/\sqrt{\log{d}}\rfloor$ elements. In this paper, we explicitly estimate $c$.
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…