Jialin Lei

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

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...