Searcharxiv⌕ Search

arXiv · 2611.13171

Smooth actions of Baumslag-Solitar groups on the interval

Abstract

We study representations of the Baumslag-Solitar group $BS(m,n)=\langle a,b\mid ab^ma^{-1}=b^n\rangle$ inside the group of orientation-preserving diffeomorphisms of the interval $[0,1]$. We prove that for integers $n,m\in \mathbb Z\setminus\{-1,0,1\}$, the group $BS(m,n)$ embeds into $\mathrm{Diff}_+^1([0,1])$ if and only if $|n|=|m|$. Furthermore, we show that for any $α\in (0,1)$, the group $BS(m,n)$ embeds inside $\mathrm{Diff}_+^{1+α}([0,1])$ if and only if $1=|m|=|n|$ or when $1=m\leq n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Franco Gómez, Cristóbal Rivas. 2026-11-09. Smooth actions of Baumslag-Solitar groups on the interval. https://searcharxiv.com/abs/2611.13171

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗