SearcharxivSearch

arXiv · 2607.23380

Automorphisms of Bestvina-Brady Groups: IA Rigidity, Arithmetic Commensurability, and Finiteness

Abstract

Let $H_\Gamma$ be the Bestvina-Brady group associated to a finite connected graph $\Gamma$. For a biconnected defining graph, we prove two structure theorems. First, restriction induces an isomorphism $\mathrm{IAut}(A_\Gamma)\cong \mathrm{IAut}(H_\Gamma)$ compatible with the Andreadakis-Johnson filtrations. Second, the quadratic and cubic lower-central relation spaces, together with the separator arrangement detected by the Bieri-Neumann-Strebel invariant, determine a rational associative algebra $\mathscr{C}_\Gamma$. Every integral rank-one square-zero element of this algebra is realized by an automorphism of $H_\Gamma$, and the subgroup generated by these roots has finite index both in the cohomological image of $\mathrm{Aut}(H_\Gamma)$ and in the unit group of an integral order in $\mathscr{C}_\Gamma$. For an arbitrary connected graph, the graph-block decomposition gives the Grushko decomposition of $H_\Gamma$. Relative free-product automorphism theory then implies that $\mathrm{Aut}(H_\Gamma)$ and $\mathrm{Out}(H_\Gamma)$ are finitely generated and satisfy the Tits alternative relative to virtually polycyclic groups. We prove that $\mathrm{Aut}(H_\Gamma)$ is finitely presented if and only if $\mathrm{Out}(H_\Gamma)$ is finitely presented. This equivalence fails for higher finiteness properties without additional hypotheses: for $\Gamma_m=C_m\vee K_3$ with $m\geq 5$, $\mathrm{Out}(H_{\Gamma_m})$ is of type $F_\infty$, whereas $\mathrm{Aut}(H_{\Gamma_m})$ is of type $F_3$ but not $F_4$. We also construct a type-$F_\infty$ Bestvina-Brady group whose automorphism and outer automorphism groups are finitely generated but not finitely presented, and show that $H_{C_n}$ is not finitely presented for $n\geq 5$, whereas $\mathrm{Out}(H_{C_n})$ is virtually infinite cyclic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jialin Lei. 2026-07-25. Automorphisms of Bestvina-Brady Groups: IA Rigidity, Arithmetic Commensurability, and Finiteness. https://arxiv.org/abs/2607.23380

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