SearcharxivSearch

arXiv · 1902.10996

On the speed of convergence to the asymptotic cone for non-singular nilpotent groups

Abstract

We study the speed of convergence to the asymptotic cone for Cayley graphs of nilpotent groups. Burago showed that $\{(\mathbb{Z}^d, \frac{1}{n} \rho,id)\}_{n\in\mathbb{N}}$ converges to $(\mathbb{R}^d,d_{\infty},id)$ and its speed is $O(\frac{1}{n})$ in the sense of Gromov-Hausdorff distance. Later Breuillard and Le Donne gave estimates for non-abelian cases, and constructed an example whose speed of convergence is slower than $O(\frac{1}{\sqrt{n}})$. For $2$-step nilpotent groups, we show that if the Mal'cev completion is non-singular, then the speed of convergence is $O(\frac{1}{n})$ for any choice of generating set. In terms of subFinsler geometry, this condition is also equivalent to the absence of abnormal geodesics on the asymptotic cone.

Explore related subjects

Keep this discovery

BibTeXRIS

Kenshiro Tashiro. 2019-02-28. On the speed of convergence to the asymptotic cone for non-singular nilpotent groups. https://doi.org/10.1007/s10711-021-00661-8

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