Related papers: Subdegree growth rates of infinite primitive permu…

In this paper we classify all maximal subgroups M of a nearly simple primitive rank 3 group G of type L=Omega_{2m+1}(3), m > 3; acting on an L-orbit E of non-singular points of the natural module for L such that 1_P^G <=1_M^G where P is a…

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$ be a finite group and $N_{\Omega}(G)$ be the intersection of the normalizers of all subgroups belonging to the set $\Omega(G),$ where $\Omega(G)$ is a set of all subgroups of $G$ which have some theoretical group property. In this…

Problem 8.75 of the Kourovka Notebook [10], attributed to John G. Thompson, asks the following: Suppose $G$ is a finite primitive permutation group on $\Omega$, and $\alpha$, $\beta$ are distinct points of $\Omega$. Does there exist an…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$ is the minimal cardinality of a base. In this paper we initiate the study of bases for…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

Let $G$ be a transitive permutation group on a set $\Omega$, and suppose $G_{\alpha}\cap G_{\beta}=1$ for some distinct $\alpha, \beta\in\Omega$. The Saxl graph $\Sigma(G)$ of $(G, \Omega)$ is defined as the graph with vertex set $\Omega$,…

Let $G$ be a finite group and recall that the Frattini subgroup ${\rm Frat}(G)$ is the intersection of all the maximal subgroups of $G$. In this paper, we investigate the intersection number of $G$, denoted $\alpha(G)$, which is the minimal…

Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ whose pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. There is a natural greedy algorithm for constructing a base of relatively small…

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

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…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H acting completely reducibly on a vector space V: if the orbits containing the vectors a and b have coprime lengths m and n, we prove that the…

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ such that the pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. Let $n$ and $r$ be positive integers with $n>2r$. The symmetric and…