SearcharxivSearch

arXiv · 2605.14862

Commutative decomposition of infinite symmetric groups and transformation monoids

Abstract

The commutative subgroup width of a group $G$ is the smallest $k$ such that there are abelian subgroups $A_0,A_1,\ldots,A_{k-1}\leq G$ with $G=A_0A_1\cdots A_{k-1}$. Commutative (inverse) submonoid width is defined analogously. In 2002, Ab\'{e}rt showed, rather surprisingly, that the commutative subgroup width of the symmetric group on an infinite set is always finite. It was later shown by Seress that it is always bounded above by $14$. We answer a question of Seress and show that in fact the commutative subgroup width of $\operatorname{Sym}(\mathbb{N})$ is at most $9$. We improve the best known lower bound to $4$. We also study standard monoid analogues of the symmetric group; showing that the commutative submonoid widths of the full transformation monoid $\mathbb{N}^\mathbb{N}$, the partial transformation monoid $P_\mathbb{N}$ and the symmetric inverse monoid $I_\mathbb{N}$ are exactly $3$. We conclude by showing that the commutative inverse submonoid width of any infinite symmetric inverse monoid is always infinite.

Explore related subjects

Keep this discovery

BibTeXRIS

Luna Elliott, Alex Levine. 2026-05-14. Commutative decomposition of infinite symmetric groups and transformation monoids. https://arxiv.org/abs/2605.14862

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