Comparing the expected number of random elements from the symmetric and the alternating groups needed to generate a transitive subgroup
DOI:
https://doi.org/10.26493/1855-3974.1664.4b6Keywords:
Transitive groups, generation, expectationAbstract
Given a transitive permutation group of degree n, we denote by eT(G) the expected number of elements of G which have to be drawn at random, with replacement, before a set of generators of a transitive subgroup of G is found. We compare eT(Sym(n)) and eT(Alt(n)).
Downloads
Published
2018-12-23
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/