Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0411466

Strongly bounded groups and infinite powers of finite groups

Yves de Cornulier
View original source ↗Read source document ↗Export metadata ↓

Abstract

We define a group as strongly bounded if every isometric action on a metric space has bounded orbits. This latter property is equivalent to the so-called uncountable strong cofinality, recently introduced by G. Bergman. Our main result is that G^I is strongly bounded when G is a finite, perfect group and I is any set. This strengthens a result of Koppelberg and Tits. We also prove that omega_1-existentially closed groups are strongly bounded.

Explore related subjects

math.GRmath.LO

Keep this discovery

BibTeXRIS

Yves de Cornulier. 2006-01-21. Strongly bounded groups and infinite powers of finite groups. https://doi.org/10.1080/00927870600550194

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗