Searcharxiv⌕ Search

arXiv · 2611.14566

Uniform Hyperbolicity of Automorphism Orbit Graphs in Rank Two

Abstract

We study automorphism orbit graphs of oriented conjugacy classes in the free group of rank two, with every elementary Whitehead move assigned unit cost. Collapsing signed permutations of the basis turns each orbit component into a tree of edges and triangles. We obtain this description by combining the known rank-two conjugacy-class stabilizer structure with the Bass-Serre tree of the rank-two outer automorphism group. The simplified graph and all its vertex-induced subgraphs have optimal thin-triangle constant zero for tree components and 3/4 otherwise. Every whole orbit component of the original graph has thin-triangle constant at most 2, while every component of every vertex-induced subgraph has constant at most 5/2. Both bounds are sharp in the primitive orbit and apply to the full geometric realization, including edge-interior triangle corners. The hereditary upper estimate also follows from known chordality theory; the whole-component improvement uses the geometry of adjacent permutation fibres. These results complement earlier fixed-length and minimum-length orbit classifications.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bilal Khan. 2026-11-08. Uniform Hyperbolicity of Automorphism Orbit Graphs in Rank Two. https://searcharxiv.com/abs/2611.14566

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↗