Corpus ID: 237571616

On generating sets of infinite symmetric group

@inproceedings{Semenov2021OnGS,
  title={On generating sets of infinite symmetric group},
  author={A. V. Semenov and Aleksandra V. Denisova},
  year={2021}
}
It was shown that in a group of bijections of an infinite set some families of subsets, related to the cardinality of some eigenspaces, are generating. Besides, we derived a criterion for generating by sets of this kind. 

References

SHOWING 1-9 OF 9 REFERENCES
Generating automorphism groups of chains
Abstract Let (Ω, ≤) be any doubly homogeneous chain and Aut(Ω) its group of order-automorphisms. We show that if J is a set of generators of Aut(Ω), then there is a positive integer n such that everyExpand
GENERATING INFINITE SYMMETRIC GROUPS
Let S = Sym(Ω) be the group of all permutations of an infinite set Ω. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, then there exists aExpand
Conjugacy classes whose square is an infinite symmetric group
Let X, be the set of all permutations 4 of an infinite set A of cardinality R, with the property: every permutation of A is a product of two conjugates of . The set X0 is shown to be the set ofExpand
Uncountable cofinalities of permutation groups
A sufficient criterion is found for certain permutation groups to have uncountable strong cofinality, that is, they cannot be expressed as the union of a countable, ascending chain of proper subsetsExpand
Subgroups of Infinite Symmetric Groups
This paper and its sequel [17] deal with a range of questions about the subgroup structure of infinite symmetric groups. Our concern is with such questions as the following. How can an infiniteExpand
Generating automorphism groups of chains, to appear, Forum Mathematicum
  • Volume 17: Issue
  • 2005
Permutation groups
Generating Countable Sets of Permutations