Fast recognition of alternating and symmetric Galois groups
From MaRDI portal
(Redirected from Publication:1585066)
Recommendations
- Explicit determination of generalized symmetric and alternating Galois groups
- Computation of the Galois group of a polynomial with rational coefficients. II
- scientific article; zbMATH DE number 3924140
- Computation of the Galois group of a polynomial with rational coefficients. I
- A Polynomial Time Nilpotence Test for Galois Groups and Related Results
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3392570 (Why is no real title available?)
- Galois groups and the factorization of polynomials
- On Random Generation of the Symmetric Group
- On polynomials with symmetric Galois group which are easy to compute
- On the Efficiency of a Polynomial Irreducibility Test
- Poisson process approximations for the Ewens sampling formula
Cited in
(9)- Computing Galois groups of polynomials (especially over function fields of prime characteristic)
- Primitivity and Orbit Decomposition
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- Explicit determination of generalized symmetric and alternating Galois groups
- Detecting fast solvability of equations via small powerful Galois groups
- Testability in group theory
- Ewens sampling and invariable generation
- Proving an execution of an algorithm correct?
This page was built for publication: Fast recognition of alternating and symmetric Galois groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585066)
