SearcharxivSearch

arXiv · 0711.2816

Automorphism Groups of Finite p-Groups: Structure and Applications

Abstract

This thesis has three goals related to the automorphism groups of finite $p$-groups. The primary goal is to provide a complete proof of a theorem showing that, in some asymptotic sense, the automorphism group of almost every finite $p$-group is itself a $p$-group. We originally proved this theorem in a paper with Martin; the presentation of the proof here contains omitted proof details and revised exposition. We also give a survey of the extant results on automorphism groups of finite $p$-groups, focusing on the order of the automorphism groups and on known examples. Finally, we explore a connection between automorphisms of finite $p$-groups and Markov chains. Specifically, we define a family of Markov chains on an elementary abelian $p$-group and bound the convergence rate of some of those chains.

Explore related subjects

Keep this discovery

BibTeXRIS

Geir T. Helleloid. 2007-11-18. Automorphism Groups of Finite p-Groups: Structure and Applications. https://arxiv.org/abs/0711.2816

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR