SearcharxivSearch

arXiv · 2601.00314

On fixed points and stabilizers in solvable Baumslag--Solitar groups

Abstract

In this article, we study the fixed-point subgroups of the solvable Baumslag-Solitar groups $\BS(1,n)= \langle a, t \mid t a t^{-1} = a^{n} \rangle$, $n>1$ of automorphisms and endomorphisms. We also investigate the stabilizers of subgroups of $\BS(1,n)$, considered as subgroups of the group of automorphisms and submonoids of the monoid of endomorphisms of $\BS(1,n)$. We show that the fixed-point subgroups of automorphisms are either infinite cyclic (in which case, a generator is computable), or they are equal to $\mathbb{Z}\left[\tfrac{1}{n}\right]$, an infinitely generated abelian group. We further prove that the stabilizer subgroup of an element in $\BS(1,n)$ is either a finitely generated abelian group whose rank equals the number of distinct prime divisors of $n$ (and in this case, a finite generating set is computable), or it is $\mathbb{Z}\left[\tfrac{1}{n}\right]$. As a corollary, we show that for all $k \in \mathbb{N}$, every element of $\BS(1,n)$ has a unique $k$-th root. We then proceed to examine the behaviour of fixed-point subgroups and stabilizers under endomorphisms and find similar results. We prove that the fixed point subgroups of endomorphisms are again infinite cyclic or $\mathbb{Z}\left[\tfrac{1}{n}\right]$, but the stabilizer submonoids are always infinitely generated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oorna Mitra, Ramya Nair. 2026-01-01. On fixed points and stabilizers in solvable Baumslag--Solitar groups. https://arxiv.org/abs/2601.00314

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