Related papers: Multiple transitivity except for a system of impri…

A group is said to be self-similar provided it admits a faithful state-closed representation on some regular $m$-tree and the group is said to be transitive self-similar provided additionally it induces transitive action on the first level…

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…

The classification of the finite primitive permutation groups of rank $3$ was completed in the 1980s and this landmark achievement has found a wide range of applications. In the general transitive setting, a classical result of Higman shows…

A graph $\Ga$ is $G$-symmetric if $\Ga$ admits $G$ as a group of automorphisms acting transitively on the set of vertices and the set of arcs of $\Ga$, where an arc is an ordered pair of adjacent vertices. In the case when $G$ is…

Let $\mathcal{D}$ be a nontrivial $3$-$(v,k,1)$ design admitting a block-transitive group $G$ of automorphisms. A recent work of Gan and the second author asserts that $G$ is either affine or almost simple. In this paper, it is proved that…

Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…

Given a transitive permutation group G of degree n , we seek to determine whether or not G is primitive, and to find a system of blocks of imprimitivity in the case that G is imprimitive. An algorithm of Atkinson solves this problem in time…

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$…

Let $G$ be a semisimple algebraic group whose decomposition into a product of simple components does not contain simple groups of type $A$, and $P\subseteq G$ be a parabolic subgroup. Extending the results of Popov [7], we enumerate all…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

Let $G$ be a permutation group on a finite set $\Omega$. The $k$-closure $G^{(k)}$ of the group $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ having the same orbits as $G$ on the $k$-th Cartesian power $\Omega^k$ of $\Omega$.…

We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex…

This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…

For every group $G$, we show that either $G$ has a topologically transitive action on the line $\mathbb R$ by orientation-preserving homeomorphisms, or every orientation-preserving action of $G$ on $\mathbb R$ has a wandering interval.…

Let $m$ be a positive integer and let $\Omega$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(\Omega)$ is the largest permutation group on $\Omega$ having the same orbits as $G$ in its induced action on the Cartesian product…

Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high `complexity' according to various measures. In recent work of…

The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…

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…

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$…

Every simply connected and connected solvable Lie group $G$ admits a simply transitive action on a nilpotent Lie group $H$ via affine transformations. Although the existence is guaranteed, not much is known about which Lie groups $G$ can…