Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userColeman automorphisms of finite groups and their minimal normal subgroups
83
0
0.0
(
0
)
Authors
Arne Van Antwerpen
Ask ChatGPT about the research
No Arabic abstract
In this paper, we show that all Coleman automorphisms of a finite group with self-central minimal non-trivial characteristic subgroup are inner; therefore the normalizer property holds for these groups. Using our methods we show that the holomorph and wreath product of finite simple groups, among others, have no non-inner Coleman automorphisms. As a further application of our theorems, we provide partial answers to questions raised by M. Hertweck and W. Kimmerle. Furthermore, we characterize the Coleman automorphisms of extensions of a finite nilpotent group by a cyclic $p$-group. Lastly, we note that class-preserving automorphisms of 2-power order of some nilpotent-by-nilpotent groups are inner, extending a result by J. Hai and J. Ge.
rate research
Read More
Let G be a finitely generated relatively hyperbolic group. We show that if no peripheral subgroup of G is hyperbolic relative to a collection of proper subgroups, then the fixed subgroup of every automorphism of G is relatively quasiconvex. It follows that the fixed subgroup is itself relatively hyperbolic with respect to a natural family of peripheral subgroups. If all peripheral subgroups of G are slender (respectively, slender and coherent), our result implies that the fixed subgroup of every automorphism of G is finitely generated (respectively, finitely presented). In particular, this happens when G is a limit group, and thus for any automorphism phi of G, Fix(phi) is a limit subgroup of G.
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 $gin G$, and by $[G,alpha]$ the subgroup generated by $I_G(alpha)$. We study the impact of $I_G(alpha)$ on the structure of $[G,alpha]$. Suppose that each subgroup generated by a subset of $I_G(alpha)$ can be generated by at most $r$ elements. We show that the rank of $[G,alpha]$ is $(e,r)$-bounded. Along the way, we establish several results of independent interest. In particular, we prove that if every element of $I_G(alpha)$ has odd order, then $[G,alpha]$ has odd order too. Further, if every pair of elements from $I_G(alpha)$ generates a soluble, or nilpotent, subgroup, then $[G,alpha]$ is soluble, or respectively nilpotent.
Recent results of Qu and Tuarnauceanu describe explicitly the finite p-groups which are not elementary abelian and have the property that the number of their subgroups is maximal among p-groups of a given order. We complement these results from the bottom level up by determining completely the non-cyclic finite p-groups whose number of subgroups among p-groups of a given order is minimal.
A finite group $P$ is said to be emph{primary} if $|P|=p^{a}$ for some prime $p$. We say a primary subgroup $P$ of a finite group $G$ satisfies the emph{Frobenius normalizer condition} in $G$ if $N_{G}(P)/C_{G}(P)$ is a $p$-group provided $P$ is $p$-group. In this paper, we determine the structure of a finite group $G$ in which every non-subnormal primary subgroup satisfies the Frobenius normalized condition. In particular, we prove that if every non-normal primary subgroup of $G$ satisfies the Frobenius condition, then $G/F(G)$ is cyclic and every maximal non-normal nilpotent subgroup $U$ of $G$ with $F(G)U=G$ is a Carter subgroup of $G$.
Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing large subgroups in finite groups (see Theorems A and C). We also consider the more specialised problems of finding large (non-abelian) nilpotent as well as abelian subgroups in soluble groups.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
