SearcharxivSearch

arXiv · 2412.00839

Relative simplicity of the universal coverings of transformation groups and Tsuboi's metric

Abstract

Many transformation groups on manifolds are simple, but their universal coverings are not. In the present paper, we study the concept of relatively simple group, that is, a group with the maximum proper normal subgroup. We show that many examples of universal coverings of transformation groups are relatively simple, including the universal covering $\widetilde{\mathrm{Ham}}(M,\omega)$ of the group of Hamiltonian diffeomorphisms of a closed symplectic manifold $(M,\omega)$. Tsuboi constructed a metric space $\mathcal{M}(G)$ for a simple group $G$. We generalize his construction to relatively simple groups, and study their large scale geometric structure. In particular, Tsuboi's metric space of $\widetilde{\mathrm{Ham}}(M, \omega)$ is not quasi-isometric to the half line for every closed symplectic manifold $(M,\omega)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Morimichi Kawasaki, Mitsuaki Kimura, Hiroki Kodama, Yoshifumi Matsuda, Takahiro Matsushita, Ryuma Orita. 2024-12-01. Relative simplicity of the universal coverings of transformation groups and Tsuboi's metric. https://arxiv.org/abs/2412.00839

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