SearcharxivSearch

arXiv · 2604.01970

Determining $\mathbb R$-Rank in Semisimple Lie Groups via uniform approximate Lattice arising as Regular Model Sets

Abstract

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every non-compact Cartan subgroup $C$ of $G$, there exists $g \in G$ such that the intersection $gCg^{-1} \cap \Lambda^2$ is non-empty and itself forms a uniform approximate lattice, extending a classical result of Mostow for lattices. The proof relies on a Moore-type ergodicity theorem for the hull of a strong approximate lattice, proved here as a key tool. Moreover, we prove that such approximate lattices determine the $\mathbb{R}$-rank of the ambient group $G$, drawing on ideas from the work of Prasad and Raghunathan on lattices.

Explore related subjects

Keep this discovery

BibTeXRIS

Arunava Mandal, Shashank Vikram Singh. 2026-04-02. Determining $\mathbb R$-Rank in Semisimple Lie Groups via uniform approximate Lattice arising as Regular Model Sets. https://arxiv.org/abs/2604.01970

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