On separated families of Anosov representations
Abstract
We introduce different notions of separation for families of Anosov representations. We show that, along a diverging sequence of such families, the critical exponent is asymptotic to a combinatorial invariant computable from the spectral data of a finite graph. Our method allows us to derive bounds on the Thurston asymmetric metric. As an application, we study specific degenerations of convex projective structures on a pair of pants, generalizing an example of McMullen.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.