Generating self-map monoids of infinite sets.

DOI10.1007/s00233-007-0731-9zbMath1133.20050arXivmath/0701198OpenAlexW3100287061MaRDI QIDQ2464353

Zachary Mesyan

Publication date: 19 December 2007

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0701198

zbMATH Keywords

monoidsfunction topologygroups of permutationslarge stabilizerspermutation groups on countably infinite set

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) General theory for infinite permutation groups (20B07)

Related Items (6)

Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones ⋮ Relative ranks of Lipschitz mappings on countable discrete metric spaces ⋮ Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. ⋮ John Macintosh Howie: work and legacy ⋮ Generating the infinite symmetric group using a closed subgroup and the least number of other elements ⋮ The Bergman-Shelah preorder on transformation semigroups

This page was built for publication: Generating self-map monoids of infinite sets.