The n-ary Adding Machine and Soluble Groups
classification
🧮 math.GR
keywords
groupn-aryaddingmachinesolubleabelianapplicationautomorphism
read the original abstract
We describe under a variety of conditions abelian subgroups of the automorphism group A of the regular n-ary tree T which are normalized by the n-ary adding machine t=(e,...,e,t)s where s is the n-cycle (0,1,...,n-1). As an application, for n a prime number, and for n = 4 we prove that every soluble subgroup of A containing t is an extension of a torsion-free metabelian group by a finite group.
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.