A modular method for computing the Galois groups of polynomials (Q1358933): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deux propriétés décidables des suites récurrentes linéaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental algorithms for permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational verification of M<sub>11</sub>and M<sub>12</sub>as galois groups over Q / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Invariant Polynomials and Their Application in Field Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Galois groups over the rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Determination of Galois Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5795524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Algebraic Number Fields / rank
 
Normal rank

Latest revision as of 16:04, 27 May 2024

scientific article
Language Label Description Also known as
English
A modular method for computing the Galois groups of polynomials
scientific article

    Statements

    A modular method for computing the Galois groups of polynomials (English)
    0 references
    10 May 1998
    0 references
    Along the lines of \textit{R. Stauduhar} [Math. Comput. 27, 981-996 (1973; Zbl 0282.12004)], the author presents a new approach for the computation of the Galois group of a rational polynomial \(f\). As in [\textit{H. Darmon} and \textit{D. Ford}, Commun. Algebra 17, No. 12, 2941-2943 (1989; Zbl 0693.12010)], \(p\)-adic approximations of the roots are used but the polynomial is not required to split completely modulo \(p\). Integrality of specialized invariants is tested via idempotents in the factor ring \(k[x_1,\ldots,x_n]/(s_i-f_i)\) (where the \(s_i\) are the elementary symmetric functions), which is represented by a Gröbner basis. The paper analyzes bounds for the required accuracy and the complexity of the lifting process (assuming knowledge of the subgroup lattice of the symmetric group). It closes with example runtimes for some groups of degree up to 7 which are compared to the implementation in Maple following \textit{T. Mattman} and \textit{J. McKay} [Math. Comput. 66, No. 218, 823-831 (1997)].
    0 references
    Galois group
    0 references
    algorithms
    0 references
    polynomials
    0 references
    complexity
    0 references
    lifting
    0 references
    0 references

    Identifiers