Symmetric Functions, m-Sets, and Galois Groups

DOI10.2307/2153295zbMath0839.05094OpenAlexW2007439323MaRDI QIDQ4317673

David Casperson, John McKay

Publication date: 20 December 1994

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2153295

zbMATH Keywords

complexityalgorithmGalois groupsproductselementary symmetric functionssumsFFT multiplication of series

Mathematics Subject Classification ID

Related Items (11)

A parallel multi-modular algorithm for computing Lagrange resolvents ⋮ Fast computation of special resultants ⋮ The complexity of computing all subfields of an algebraic number field ⋮ Galois groups over function fields of positive characteristic ⋮ Using Galois ideals for computing relative resolvents ⋮ Galois group computation for rational polynomials ⋮ Special issue: Algorithmic methods in Galois theory ⋮ A Polynomial with Galois Groups SL₂(F₁₆) ⋮ Computation of Galois groups over function fields ⋮ General formulas for solving solvable sextic equations ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)

Uses Software

• PARI/GP

This page was built for publication: Symmetric Functions, m-Sets, and Galois Groups