A note on invariable generation of nonsolvable permutation groups

From MaRDI portal




Abstract: We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group Sn which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same solvable subgroup of Sn. As an application, we obtain that for a large degree "random" integer polynomial f, reduction modulo two different primes can be expected to suffice to prove the nonsolvability of Gal(f/mathbbQ).









This page was built for publication: A note on invariable generation of nonsolvable permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825546)