Related papers: Finite Groups with 6 or 7 Automorphism Orbits
Denote by $\omega(G)$ the number of orbits of the action of $Aut(G)$ on the finite group $G$. We prove that if $G$ is a finite nonsolvable group in which $\omega(G) \leqslant 5$, then $G$ is isomorphic to one of the groups…
Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper we prove that if $G$ is an FC-group with…
Let $G$ be a group. The orbits of the natural action of $Aut(G)$ on $G$ are called the automorphism orbits of $G$, and their number is denoted by $\omega(G)$. Let $\mathbb{F}$ be an infinite field, and let $UT_n(\mathbb{F})$ denote the…
Let $G$ be a group. The orbits of the natural action of Aut$(G)$ on $G$ are called ``automorphism orbits'' of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. We prove that if $G$ is a soluble group with finite…
We study finite groups $G$ such that the maximum length of an orbit of the natural action of the automorphism group $\operatorname{Aut}(G)$ on $G$ is bounded from above by a constant. Our main results are the following: Firstly, a finite…
We give a complete classification of the finite $2$-groups $G$ for which the automorphism group $\operatorname{Aut}(G)$ acting naturally on $G$ has three orbits. There are two infinite families and one additional group, of order $2^9$. All…
For a finite group $G$, we denote by $\omega(G)$ the number of $\operatorname{Aut}(G)$-orbits on $G$, and by $\operatorname{o}(G)$ the number of distinct element orders in $G$. In this paper, we are primarily concerned with the two…
We give a complete and irredundant list of the finite groups $G$ for which Aut$(G)$, acting naturally on $G$, has precisely $3$ orbits. There are 7 infinite families: one abelian, one non-nilpotent, three families of non-abelian $2$-groups…
Let $G$ be a finite group, and assume that $G$ has an automorphism of order at least $\rho|G|$, with $\rho\in\left(0,1\right)$. Generalizing recent analogous results of the author on finite groups with a large automorphism cycle length, we…
We study the nonabelian composition factors of a finite group $G$ assumed to admit an $\operatorname{Aut}(G)$-orbit of length at least $\rho|G|$, for a given $\rho\in\left(0,1\right]$. Our main results are the following: The orders of the…
We address several specific aspects of the following general question: can a field K have so many automorphisms that the action of the automorphism group on the elements of K has relatively few orbits? We prove that any field which has only…
Let $G$ be a group. The orbits of the natural action of $\Aut(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. Let $G$ be a virtually nilpotent group such that…
An automorphism $\alpha$ of a group $G$ is normal if it fixes every normal subgroup of $G$ setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively…
We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…
We call a finite group G ultrasolvable if it has a characteristic subgroup series whose factors are cyclic. It was shown by Durbin--McDonald that the automorphism group of an ultrasolvable group is supersolvable. The converse statement was…
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…
A complete classification is given of finite groups whose elements are partitioned into three orbits by the automorphism groups, solving the long-standing classification problem initiated by G. Higman in 1963. As a consequence, a…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of the finite group $G$. We prove that if $G$ is a group with $\lambda(G) \leqslant 6$, then $G$ is supersolvable. We also describe the structure of the groups…
We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.