Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1505.05497

Combinatorics of the tame automorphism group

Stéphane Lamy
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the group Tame($\mathbf A^3$) of tame automorphisms of the 3-dimensional affine space, over a field of characteristic zero. We recover, in a unified and (hopefully) simplified way, previous results of Kuroda, Shestakov, Umirbaev and Wright, about the theory of reduction and the relations in Tame($\mathbf A^3$). The novelty in our presentation is the emphasis on a simply connected 2-dimensional simplicial complex on which Tame($\mathbf A^3$) acts by isometries.

Explore related subjects

math.GRmath.AG

Keep this discovery

BibTeXRIS

Stéphane Lamy. 2015-05-20. Combinatorics of the tame automorphism group. https://doi.org/10.5802/afst.1597

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗