Certifying Anosov representations
Abstract
By providing new finite criteria which certify that a finitely generated subgroup of SL(d,R) or SL(d,C) is projective Anosov, we obtain a practical algorithm to verify the Anosov condition. We demonstrate on a surface group of genus 2 in SL(3,R) by verifying the criteria for all words of length 8. The previous version required checking all words of length 2 million.
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.