Search arXivSearch

arXiv · 1407.3903

Maximal representations of complex hyperbolic lattices in SU(m,n)

Abstract

Let $\Gamma$ denote a lattice in $SU(1,p)$, with $p$ greater than 1. We show that there exists no Zariski dense maximal representation with target $SU(m,n)$ if $n>m>1$. The proof is geometric and is based on the study of the rigidity properties of the geometry whose points are isotropic $m$-subspaces of a complex vector space $V$ endowed with a Hermitian metric $h$ of signature $(m,n)$ and whose lines correspond to the $2m$ dimensional subspaces of $V$ on which the restriction of $h$ has signature $(m,m)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Maria Beatrice Pozzetti. 2014-07-15. Maximal representations of complex hyperbolic lattices in SU(m,n). https://arxiv.org/abs/1407.3903

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