{"title":"Certifying Anosov representations","authors":"J. Maxwell Riestenberg","doi":"10.1112/blms.70342","DOIUrl":null,"url":null,"abstract":"<p>By providing new finite criteria which certify that a finitely generated subgroup of <span></span><math>\n <semantics>\n <mrow>\n <mo>SL</mo>\n <mo>(</mo>\n <mi>d</mi>\n <mo>,</mo>\n <mrow>\n <mo>R</mo>\n </mrow>\n <mo>)</mo>\n </mrow>\n <annotation>$\\operatorname{SL}(d,\\operatorname{\\mathbb {R}})$</annotation>\n </semantics></math> or <span></span><math>\n <semantics>\n <mrow>\n <mo>SL</mo>\n <mo>(</mo>\n <mi>d</mi>\n <mo>,</mo>\n <mi>C</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$\\operatorname{SL}(d,\\mathbb {C})$</annotation>\n </semantics></math> is projective Anosov, we obtain a practical algorithm to verify the Anosov condition. We demonstrate on a surface group of genus 2 in <span></span><math>\n <semantics>\n <mrow>\n <mi>SL</mi>\n <mo>(</mo>\n <mn>3</mn>\n <mo>,</mo>\n <mi>R</mi>\n <mo>)</mo>\n </mrow>\n <annotation>$\\mathrm{SL}(3,\\mathbb {R})$</annotation>\n </semantics></math> by verifying the criteria for all words of length 8. The previous version required checking all words of length 2 million.</p>","PeriodicalId":55298,"journal":{"name":"Bulletin of the London Mathematical Society","volume":"58 4","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2026-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://londmathsoc.onlinelibrary.wiley.com/doi/epdf/10.1112/blms.70342","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the London Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://londmathsoc.onlinelibrary.wiley.com/doi/10.1112/blms.70342","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
By providing new finite criteria which certify that a finitely generated subgroup of or is projective Anosov, we obtain a practical algorithm to verify the Anosov condition. We demonstrate on a surface group of genus 2 in by verifying the criteria for all words of length 8. The previous version required checking all words of length 2 million.