The orbital counting problem for hyperconvex representations (Q5962682)
From MaRDI portal
scientific article; zbMATH DE number 6541667
Language | Label | Description | Also known as |
---|---|---|---|
English | The orbital counting problem for hyperconvex representations |
scientific article; zbMATH DE number 6541667 |
Statements
The orbital counting problem for hyperconvex representations (English)
0 references
15 February 2016
0 references
The orbital counting problem asks for the asymptotics of the number \(\# \{ g \in \Delta ; d_X( o, g\cdot o) \leq t \}\) as \(t \rightarrow \infty\), where \(\Delta\) is a discrete subgroup of a connected non-compact real algebraic semisimple Lie group \(G\), where \(o\) is the basepoint \([K]\) of the symmetric space \(X= G / K\) of \(G\) and \(d_X\) is an invariant Riemannian metric on \(X\). The problem has been solved for the case that \(\Delta\) is a lattice in \(G\), see \textit{A. Eskin} and \textit{C. McMullen} [Duke Math. J. 71, No. 1, 181--209 (1993; Zbl 0798.11025)] and \textit{W. Duke} et al. [Duke Math. J. 71, No. 1, 143--179 (1993; Zbl 0798.11024)]. The author's focus is thus on subgroups \(\Delta\) of infinite covolume. The main result gives the asymptotic for the counting problem for a class of representations called hyperconvex. Examples of hyperconvex representations are the representations in a Hitchin component of \(\mathrm{PSL}(d, \mathbb{R})\), see [\textit{F. Labourie}, Invent. Math. 165, No. 1, 51--114 (2006; Zbl 1103.32007)]. For a Zariski dense hyperconvex representation the number in question is asymptotically a constant times \(e^{ht}\), where \(h\) is the topological entropy of a flow that the author constructs, namely the Weyl chamber flow. An important step in the paper is the proof of a mixing property for this flow on a subset, which is analogous to the non-wandering set for the geodesic flow in negative curvature. What makes it difficult to find one's way through the otherwise very well written paper is the typo that in a given section, say \(n\), all the theorems, lemmata, definitions, etc. are numbered \(n.0\).
0 references
Lie groups
0 references
counting problem
0 references
mixing
0 references
higher rank geometries
0 references
hyperconvex representations
0 references
Hitchin representations
0 references