A note on invariable generation of nonsolvable permutation groups

From MaRDI portal
Revision as of 13:40, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:825546

DOI10.1007/S10801-021-01045-7zbMATH Open1479.05008arXiv2102.04007OpenAlexW3158595287MaRDI QIDQ825546FDOQ825546

Gicheol Shin, Joachim König

Publication date: 17 December 2021

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/2102.04007





Cites Work


Cited In (3)






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)