Fast recognition of alternating and symmetric Galois groups
From MaRDI portal
Publication:1585066
DOI10.1016/S0022-4049(99)00078-XzbMath0960.11053WikidataQ127451598 ScholiaQ127451598MaRDI QIDQ1585066
Publication date: 10 May 2001
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Ewens Sampling and Invariable Generation ⋮ Explicit determination of generalized symmetric and alternating Galois groups ⋮ Primitivity and Orbit Decomposition ⋮ Proving an execution of an algorithm correct? ⋮ Four random permutations conjugated by an adversary generateSnwith high probability ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)
Cites Work
- On polynomials with symmetric Galois group which are easy to compute
- Poisson process approximations for the Ewens sampling formula
- On the Efficiency of a Polynomial Irreducibility Test
- On Random Generation of the Symmetric Group
- Galois groups and the factorization of polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast recognition of alternating and symmetric Galois groups
