SearcharxivSearch

arXiv · 1104.4705

Quantitative properties of convex representations

Abstract

Let $\Gamma$ be a discrete subgroup of $\textrm{PGL}(d,\R)$ and fix some euclidean norm $\|\ \|$ on $\R^d.$ Let $N_\Gamma(t)$ be the number of elements in $\Gamma$ whose operator norm is $\leq t.$ In this article we prove an asymptotic for the growth of $N_\Gamma(t)$ when $t\to\infty$ for a class of $\Gamma$'s which contains, in particular, Hitchin representations of surface groups and groups dividing a convex set of $\P(\R^d).$ We also prove analogue counting theorems for the growth of the spectral radii. More precise information is given for Hitchin representations.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrés Sambarino. 2011-04-25. Quantitative properties of convex representations. https://arxiv.org/abs/1104.4705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR