Related papers: Most primitive groups are full automorphism groups…

A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of…

The paper is intended to be a survey on some topics within the framework of automorphisms of a relatively free groups of infinite rank. We discuss such properties as tameness, primitivity, small index, Bergman property, and so on.

We explore the topological full group [[G]] of an essentially principal etale groupoid G on a Cantor set. When G is minimal, we show that [[G]] (and its certain normal subgroup) is a complete invariant for the isomorphism class of the etale…

If $G$ is a group of permutations of a set $\Omega$, then the suborbits of $G$ are the orbits of point-stabilisers $G_\alpha$ acting on $\Omega$. The cardinalities of these suborbits are the subdegrees of $G$. Every infinite primitive…

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the…

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…

The subgroup commutativity degree of a group G has been defined in [6] as the probability that two subgroups of G commute, or equivalently that the product of two subgroups is again a subgroup. Problem 4.3 of [6] asks whether there exist…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

We prove that the natural permutation representation of highly transitive finite groups cannot be realized as the full automorphism group of an idempotent, finite-dimensional evolution algebra acting on the set of lines spanned by its…

Let $H$ be a subgroup of $\text{Sym}_n$, the symmetric group of degree $n$. For a fixed integer $l \geq 2$, the group $G$ presented with generators $x_1, x_2, \ldots ,x_n$ and with relations $x_{i_1}x_{i_2}\cdots x_{i_l} =x_{\sigma (i_1)}…

A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…

This is the third in a series of papers in which we prove a conjecture of Boston and Shalev that the proportion of derangements (fixed point free elements) is bounded away from zero for transitive actions of finite simple groups on a set of…

Let $G$ be a finite group and $\Aut(G)$ the automorphism group of $G$. The autocommuting probability of $G$, denoted by $\Pr(G, \Aut(G))$, is the probability that a randomly chosen automorphism of $G$ fixes a randomly chosen element of $G$.…

Let $G$ be a finite group, let $p$ be a prime and let ${\rm Pr}_p(G)$ be the probability that two random $p$-elements of $G$ commute. In this paper we prove that ${\rm Pr}_p(G) > (p^2+p-1)/p^3$ if and only if $G$ has a normal and abelian…

Let $X$ be a compact Riemann surface of genus $g\geq 2$, and let $G$ be a subgroup of $Aut(X)$. We show that if the Sylow $2$-subgroups of $G$ are cyclic, then $|G|\leq 30(g-1)$. If all Sylow subgroups of $G$ are cyclic, then, with two…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer in $G$ is trivial. By $b(G)$ we denote the size of the smallest base of $G$. Every permutation group with $b(G)=2$ contains…

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…

A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a…