A note on invariable generation of nonsolvable permutation groups
From MaRDI portal
Publication:825546
DOI10.1007/S10801-021-01045-7zbMATH Open1479.05008arXiv2102.04007OpenAlexW3158595287MaRDI QIDQ825546FDOQ825546
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 which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same solvable subgroup of . As an application, we obtain that for a large degree "random" integer polynomial , reduction modulo two different primes can be expected to suffice to prove the nonsolvability of .
Full work available at URL: https://arxiv.org/abs/2102.04007
Cites Work
- Title not available (Why is that?)
- The Magma algebra system. I: The user language
- The probability that a pair of elements of a finite group are conjugate
- Random sets which invariably generate the symmetric group
- Invariable generation and the Chebotarev invariant of a finite group.
- On Random Generation of the Symmetric Group
- PRIMITIVE PERMUTATION GROUPS CONTAINING A CYCLE
- A bound for the least prime ideal in the Chebotarev density theorem
- Irreducible polynomials of bounded height
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- Invariable generation of the symmetric group
- The concept of primitivity in group theory and the second memoir of Galois
- The Chebotarev invariant of a finite group: A conjecture of Kowalski and Zywina
- Most permutations power to a cycle of small prime length
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)