2011Canadian Mathematical BulletinOpen access

Automorphisms of Iterated Wreath Product p-Groups

Jeffrey M. Riedl

Open full text 3 citations

Abstract

Abstract We determine the order of the automorphism group Aut(W) for each member W of an important family of finite p-groups that may be constructed as iterated regular wreath products of cyclic groups. We use a method based on representation theory.

Open-access reader

About this research paper

What this paper is about

Abstract We determine the order of the automorphism group Aut(W) for each member W of an important family of finite p-groups that may be constructed as iterated regular wreath products of cyclic groups. We use a method based on representation theory.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract We determine the order of the automorphism group Aut(W) for each member W of an important family of finite p-groups that may be constructed as iterated regular wreath products of cyclic groups. We use a method based on representation theory.

Key concepts: Mathematics, Wreath product, Automorphism, Iterated function, Order (exchange), Product (mathematics), Cyclic group, Pure mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Automorphisms of Iterated Wreath Product p-Groups — Research Paper | ScholarLens