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 A0,A1,…,Ak-1≤ G with G=A0A1·s Ak-1. Commutative (inverse) submonoid width is defined analogously. In 2002, Abé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 Sym(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 NN, the partial transformation monoid PN and the symmetric inverse monoid IN are exactly 3. We conclude by showing that the commutative inverse submonoid width of any infinite symmetric inverse monoid is always infinite.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…