English
Related papers

Related papers: Certifying Anosov representations

200 papers

Navarro has conjectured a necessary and sufficient condition for a finite group $G$ to have a self-normalising Sylow $2$-subgroup, which is given in terms of the ordinary irreducible characters of $G$. The first-named author has reduced the…

Representation Theory · Mathematics 2018-05-23 Amanda Schaeffer Fry , Jay Taylor

We prove that a random group, in Gromov's density model with $d < 1/16$ satisfies with overwhelming probability a universal-existential first-order sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a…

Logic · Mathematics 2022-12-23 Olga Kharlampovich , Rizos Sklinos

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

Group Theory · Mathematics 2008-04-07 Danny Calegari

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

Group Theory · Mathematics 2008-12-23 J. O. Button

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

Group Theory · Mathematics 2024-12-05 Jonathan Warne

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

Number Theory · Mathematics 2016-09-07 Igor Rivin

In this note we give an overview of some of our recent work on Anosov representations of discrete groups into higher rank semisimple Lie groups.

Group Theory · Mathematics 2015-12-01 Michael Kapovich , Bernhard Leeb , Joan Porti

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

Number Theory · Mathematics 2015-01-08 Igor Rivin

We construct examples of quasi-isometric embeddings of word hyperbolic groups into $\mathsf{SL}(d,\mathbb{R})$ for $d \geqslant 5$ which are not limits of Anosov representations into $\mathsf{SL}(d,\mathbb{R})$. As a consequence, we…

Geometric Topology · Mathematics 2020-02-28 Konstantinos Tsouvalas

We provide characterizations of Anosov representations of word hyperbolic groups into real semisimple Lie groups in terms of the existence of equivariant limit maps on the Gromov boundary, the Cartan property and the uniform gap summation…

Geometric Topology · Mathematics 2025-10-14 Konstantinos Tsouvalas

We study infinite covolume discrete subgroups of higher rank semisimple Lie groups, motivated by understanding basic properties of Anosov subgroups from various viewpoints (geometric, coarse geometric and dynamical). The class of Anosov…

Group Theory · Mathematics 2017-03-07 Michael Kapovich , Bernhard Leeb , Joan Porti

We establish several characterizations of Anosov representations of word hyperbolic groups into real reductive Lie groups, in terms of a Cartan projection or Lyapunov projection of the Lie group. Using a properness criterion of Benoist and…

Group Theory · Mathematics 2017-02-15 François Guéritaud , Olivier Guichard , Fanny Kassel , Anna Wienhard

Wajnryb proved that the mapping class group of a closed oriented surface is generated by two elements. We proved that the mapping class group is generated by two pseudo-Anosov elements. In particular, if the genus is greater than or equal…

Geometric Topology · Mathematics 2025-09-03 Susumu Hirose , Naoyuki Monden

We give a computationally effective criterion for determining whether a finite-index subgroup of SL(2, Z) is a congruence subgroup, extending earlier work of Hsu for subgroups of PSL(2, Z).

Number Theory · Mathematics 2019-02-20 Thomas Hamilton , David Loeffler

We improve the Solovay--Kitaev theorem and algorithm for a general finite, inverse-closed generating set acting on a qudit. Prior versions of the algorithm efficiently find a word of length $O(n^{3+\delta})$ to approximate an arbitrary…

Quantum Physics · Physics 2025-10-09 Greg Kuperberg

The celebrated Livsic theorem states that given M a manifold, a Lie group G, a transitive Anosov diffeomorphism f on M and a Holder function \eta: M \mapsto G whose range is sufficiently close to the identity, it is sufficient for the…

Dynamical Systems · Mathematics 2007-11-22 Rafael de la Llave , Alistair Windsor

We identify all Anosov representations of compact hyperbolic triangle reflection groups into the higher rank Lie group $\mathrm{SL}(3,\mathbb R)$. Specifically, we prove that such a representation is Anosov if and only if either it lies in…

Geometric Topology · Mathematics 2026-01-05 Gye-Seon Lee , Jaejeong Lee , Florian Stecker

We construct the first known examples of nontrivial, normal, all pseudo-Anosov subgroups of mapping class groups of surfaces. Specifically, we construct such subgroups for the closed genus two surface and for the sphere with five or more…

Geometric Topology · Mathematics 2014-11-11 Kim Whittlesey

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

Group Theory · Mathematics 2024-04-30 Max Horn , Alice Niemeyer , Cheryl Praeger , Daniel Rademacher

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

Formal Languages and Automata Theory · Computer Science 2022-07-28 Dominique Perrin , Andrew Ryzhikov