arXiv Analytics

Sign in

arXiv:1602.03957 [math.GR]AbstractReferencesReviewsResources

Computational Enumeration of Independent Generating Sets of Finite Symmetric Groups

Attila Egri-Nagy

Published 2016-02-12Version 1

We computationally enumerate independent generating sets of symmetric groups up to $n=7$.

Comments: 7 pages, 5 tables, preliminary report of computational results, full paper version will be published elsewhere
Categories: math.GR
Subjects: 20B30, 20B35
Related articles: Most relevant | Search more
arXiv:1402.4837 [math.GR] (Published 2014-02-19)
Invariant random subgroups of strictly diagonal limits of finite symmetric groups
arXiv:2405.01179 [math.GR] (Published 2024-05-02)
Finite symmetric groups are strongly verbally closed
arXiv:1802.09289 [math.GR] (Published 2018-02-26)
Word images in symmetric and unitary groups are dense

Links

Toolbox