SearcharxivSearch

arXiv · math/0403223

Infinite-dimensional general linear groups are groups of universally finite width

Abstract

Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set $Ω,$ there is a uniform bound $k \in \N$ such that any permutation $σ\in \text{Sym}(Ω)$ is a product of at most $k$ elements of $X \cup X^{-1},$ or, in other words, $\text{Sym}(Ω)=(X^{\pm 1})^k.$ Bergman also formulated a sort of general conjecture stating that `the automorphism groups of structures that can be put together out of many isomorphic copies of themselves' might be groups of universally finite width and particularly mentioned, in this respect, infinite-dimensional linear groups. In this note we confirm Bergman's conjecture for infinite-dimensional linear groups over division rings.

Explore related subjects

Keep this discovery

BibTeXRIS

Vladimir Tolstykh. 2004-03-16. Infinite-dimensional general linear groups are groups of universally finite width. https://arxiv.org/abs/math/0403223

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