Comparing the expected number of random elements from the symmetric and the alternating groups needed to generate a transitive subgroup

Andrea Lucchini, Mariapia Moscatiello


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)).


Transitive groups, generation, expectation

Full Text:



ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications