SearcharxivSearch

arXiv · 1403.6798

Splitting automorphisms of prime power orders of free Burnside groups

Abstract

We prove that if the order of a splitting automorphism of free Burnside group~$B(m,n)$ of odd period~$n\ge1003$ is a prime power, then the automorphism is inner. Thus, we give an affirmative answer to the question on the coincidence of splitting and inner automorphisms of free Burnside groups $B(m,n)$ for automorphisms of orders~$p^k$ ($p$ is a prime number). This question was posed in the Kourovka Notebook in 1990 (see 11th ed., Question 11.36.~b).

Explore related subjects

Keep this discovery

BibTeXRIS

Varujan S. Atabekyan. 2014-03-26. Splitting automorphisms of prime power orders of free Burnside groups. https://doi.org/10.1134/s0001434614050022

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