Generating Countable Sets of Permutations

DOI10.1112/jlms/51.2.230zbMath0837.20005OpenAlexW1973276289MaRDI QIDQ4842039

No author found.

Publication date: 26 July 1995

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/51.2.230

zbMATH Keywords

generatorsembedding theorems2-generator subgroupscoverings of countable subsetsinfinite symmetric permutation groups

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Symmetric groups (20B30) Subgroups of symmetric groups (20B35)

Related Items (19)

Endomorphism rings generated using small numbers of elements ⋮ Generating Borel measurable mappings with continuous mappings ⋮ On generating sets of infinite symmetric group ⋮ Relative ranks of Lipschitz mappings on countable discrete metric spaces ⋮ Strong distortion in transformation groups ⋮ Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances. ⋮ Infinite dual symmetric inverse monoids ⋮ Generation of infinite factorizable inverse monoids. ⋮ John Macintosh Howie: work and legacy ⋮ Almost disjoint permutation groups ⋮ On relative ranks of the semigroup of orientation-preserving transformations on infinite chains ⋮ A topological generalization of the HigmanNeumannNeumann theorem ⋮ Distortion in transformation groups (with an appendix by Yves de Cornulier) ⋮ Generating the infinite symmetric group using a closed subgroup and the least number of other elements ⋮ Sets of universal sequences for the symmetric group and analogous semigroups ⋮ Universal sequences for the order-automorphisms of the rationals ⋮ Idempotents and one-sided units in infinite partial Brauer monoids ⋮ Generating continuous mappings with Lipschitz mappings ⋮ Infinite partition monoids

This page was built for publication: Generating Countable Sets of Permutations