pith. sign in

arxiv: math/0602039 · v5 · pith:VVU7QZ42new · submitted 2006-02-02 · 🧮 math.GR · math.CO

The Automorphism Group of a Finite p-Group is Almost Always a p-Group

classification 🧮 math.GR math.CO
keywords p-groupfinitegroupautomorphismalmostalwayscountingfree
0
0 comments X
read the original abstract

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism group of a finite p-group is almost always a p-group. The asymptotics in our theorem involve fixing any two of the following parameters and letting the third go to infinity: the lower p-length, the number of generators, and p. The proof of this theorem depends on a variety of topics: counting subgroups of a p-group; analyzing the lower p-series of a free group via its connection with the free Lie algebra; counting submodules of a module via Hall polynomials; and using numerical estimates on Gaussian coefficients.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.