SearcharxivSearch

arXiv · 1103.0944

Transience of algebraic varieties in linear groups and application to generic Zariski density

Abstract

We study the transience of algebraic varieties in linear groups. In particular, we show that a "non elementary" random walk in SL_2(R) escapes exponentially fast from every proper algebraic subvariety. We also treat the case where the random walk is on the real points of a semi-simple split algebraic group and show such a result for a wide family of random walks. As an application, we prove that generic subgroups (in some sense) of linear groups are Zariski dense.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard Aoun. 2011-03-04. Transience of algebraic varieties in linear groups and application to generic Zariski density. https://arxiv.org/abs/1103.0944

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