加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本