Related papers: Cherlin's conjecture on finite primitive binary pe…

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

Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this…

We show that the set of all commuting probabilities in finite rings is a subset of the set of all commuting probabilities in finite nilpotent groups of class $\le2$. We believe that these two sets are equal; we prove they are equal, when…

A classical theorem of Scheunert on $G$-color Lie algebras, asserts in the case of finitely generated abelian groups, one can twist the algebra structure and the commutation bicharacter on $G$ by a 2-cocycle twist to a super-Lie $G$ graded,…

A finite group $G$ is called a Schur group if every $S$-ring over $G$ is schurian, i.e. associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. One of the crucial questions in the $S$-ring theory is the…

We show that the minimal base size $b(G)$ of a finite primitive permutation group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is asymptotically best possible since there exists a sequence of primitive permutation…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

A group $G$ is said to have restricted centralizers if for each $g \in G$ the centralizer $C_G(g)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. We take…

The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…

We study Cartesian decompositions of sets that are acted upon intransitively by innately transitive permutation groups. We prove that such groups have at most three orbits on such a decomposition. A consequence of this result is that if $G$…

The problem of describing the invariance groups of unordered relations, called briefly \emph{relation groups}, goes back to classical work by H. Wielandt. In general, the problem turned out to be hard, and so far it has been settled only…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…

We prove that if $G$ is a transitive permutation group of sufficiently large degree $n$, then either $G$ is primitive and Frobenius, or the proportion of derangements in $G$ is larger than $1/(2n^{1/2})$. This is sharp, generalizes…

A group $G$ is said to be totally $2$-closed if in each of its faithful permutation representations, say on a set $\Omega$, $G$ is the largest subgroup of $\mathrm{Sym}(\Omega)$ which leaves invariant each of the $G$-orbits for the induced…

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…

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…

We prove that if $G$ is a finite simple group of Lie type and $S$ a subset of $G$ of size at least two then $G$ is a product of at most $c\log|G|/\log|S|$ conjugates of $S$, where $c$ depends only on the Lie rank of $G$. This confirms a…

Let $G$ be a finite group and let $\textrm{cd}(G)$ be the set of all complex irreducible character degrees of $G.$ In this paper, we show that if $\textrm{cd}(G)=\textrm{cd}(H),$ where $H$ is a finite simple exceptional group of Lie type,…