Related papers: Groups with supersolvable automorphism group
Let $A$ be a group isomorphic with either $S_4$, the symmetric group on four symbols, or $D_8$, the dihedral group of order 8. Let $V$ be a normal four-subgroup of $A$ and $\alpha$ an involution in $A\setminus V$. Suppose that $A$ acts on a…
Let $FH$ be a supersolvable Frobenius group with kernel $F$ and complement $H$. Suppose that a finite group $G$ admits $FH$ as a group of automorphisms in such a manner that $C_G(F)=1$ and $C_{G}(H)$ is nilpotent of class $c$. We show that…
The solvability of monomial groups is a well-known result in character theory. Certain properties of Artin L-series suggest a generalization of these groups, namely to such groups where every irreducible character has some multiple which is…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
For each prime $p$ we construct a family $\{G_i\}$ of finite $p$-groups such that $|\Aut (G_i)|/|G_i|$ goes to $0$, as $i$ goes to infinity. This disproves a well-known conjecture that $|G|$ divides $|\Aut(G)|$ for every non-abelian finite…
In the paper autonilpotent groups were characterized as groups $G$ such that $\mathrm{Aut}G$ stabilizes some chain of subgroups of $G$. It was shown that a $p$-group is autonilpotent if and only if its group of automorphisms is also a…
Let $G$ be finite group. A subgroup $H$ of $G$ is said to be an $SS$-quasinormal subgroup of $G$, if there exists a subgroup $B$ of $G$ such that $G = HB$ and $H$ permutes with every Sylow subgroup of $B$. Let $\Omega:…
Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.
We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…
Let $G,D_{0},D_{1}$ be finite groups such that $D_{0}\trianglelefteq D_{1}$ are groups of automorphisms of $G$ that contain the inner automorphisms of $G$. Assume that $D_{1}/D_{0}$ has a normal $2$-complement and that $D_{1}$ acts…
This paper shows that the automorphism group of a Beauville surface is a finite solvable group, and describes its possible structure. It relies on results of Singerman on triangle group inclusions, and of Lucchini on generators for special…
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…
We characterize the irreducible polynomials that occur as a characteristic polynomial of an automorphism of an even unimodular lattice of given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general…
Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.
For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…
Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
A celebrated result of J. Thompson says that if a finite group $G$ has a fixed-point-free automorphism of prime order, then $G$ is nilpotent. The main purpose of this note is to extend this result to finite inverse semigroups. An earlier…