Related papers: Orbit-equivalent infinite permutation groups

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…

A permutation group $G\le\operatorname{Sym}(\Omega)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(\Omega)$ has the same orbits on $\Omega\times\Omega$ as $G$. A simple and efficient inductive criterion for…

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…

We prove that if $G$ is a finite primitive permutation group and if $g$ is an element of $G$, then either $g$ has a cycle of length equal to its order, or for some $r$, $m$ and $k$, the group $G \leq \mathrm{Sym}(m) \textrm{wr}…

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…

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…

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 transitive group of permutations of a finite set X, and suppose that some element of G has at most two orbits on X. We prove that any two maximal chains of groups between G and a point-stabilizer of G have the same length, and…

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three…

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 permutation group $G$ on $\Omega$ is called a rank 3 group if it has precisely three orbits in its induced action on $\Omega \times \Omega$. The largest permutation group on $\Omega$ having the same orbits as $G$ on $\Omega \times \Omega$…

This paper introduces the notion of orbit coherence in a permutation group. Let $G$ be a group of permutations of a set $\Omega$. Let $\pi(G)$ be the set of partitions of $\Omega$ which arise as the orbit partition of an element of $G$. The…

An abstract group $G$ is called totally $2$-closed if $H=H^{(2),\Omega}$ for any set $\Omega$ with $G\cong H\leq{\rm Sym}(\Omega)$, where $H^{(2),\Omega}$ is the largest subgroup of ${\rm Sym}(\Omega)$ whose orbits on $\Omega\times\Omega$…

Let G be a reductive algebraic group and let H be a reductive subgroup of G. We describe all pairs (G,H) such that for any affine G-variety X with a dense G-orbit isomorphic to G/H the number of G-orbits in X is finite. The maximal number…

Let G be a simply connected semisimple algebraic group over an algebraically closed field k of characteristic 0 and let V be a rational simple G-module of finite dimension. If G/H \subset P(V) is a spherical orbit and if X is its closure,…

A finite permutation group $G$ on $\Omega$ is called a rank 3 group if it has precisely three orbits in its induced action on $\Omega \times \Omega$. The largest permutation group on $\Omega$ having the same orbits as $G$ on $\Omega \times…

A permutation group $(X,G)$ is said to be binary, or of relational complexity $2$, if for all $n$, the orbits of $G$ (acting diagonally) on $X^2$ determine the orbits of $G$ on $X^n$ in the following sense: for all $\bar{x},\bar{y} \in…

We study finite transitive permutation groups $G\leqslant\operatorname{Sym}(\Omega)$ such that all orbits of the conjugation action on $G$ of the normaliser of $G$ in $\operatorname{Sym}(\Omega)$ have size bounded by some constant. Our…

Let $G$ be a finite permutation group on $\Omega$. An ordered sequence of elements of $\Omega$, $(\omega_1,\dots, \omega_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(\omega_1,\dots, \omega_t)}$ is trivial and no…