SearcharxivSearch

arXiv · math/0401305

Closed subgroups of the infinite symmetric group

Abstract

Let S=Sym(Ω) be the group of all permutations of a countably infinite set Ω, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if there exists a finite set U\subseteq S such that < G_1\cup U > = < G_2\cup U >. It is shown that the subgroups closed in the function topology on S lie in precisely four equivalence classes under this relation. Which of these classes a closed subgroup G belongs to depends on which of the following statements about pointwise stabilizer subgroups G_{(Γ)} of finite subsets Γ\subseteqΩholds: (i) For every finite set Γ, the subgroup G_{(Γ)} has at least one infinite orbit in Ω. (ii) There exist finite sets Γsuch that all orbits of G_{(Γ)} are finite, but none such that the cardinalities of these orbits have a common finite bound. (iii) There exist finite sets Γsuch that the cardinalities of the orbits of G_{(Γ)} have a common finite bound, but none such that G_{(Γ)}=\{1\}. (iv) There exist finite sets Γsuch that G_{(Γ)}=\{1\}. Some questions for further investigation are discussed.

Explore related subjects

Keep this discovery

BibTeXRIS

George M. Bergman, Saharon Shelah. 2005-05-27. Closed subgroups of the infinite symmetric group. https://doi.org/10.1007/s00012-006-1959-z

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