Using Galois ideals for computing relative resolvents
Let \(k\) be a perfect field and \(\overline{k}\) an algebraic closure of \(k\). Let, \(f\in k[X]\) be a separable univariate polynomial of degree \(n\) and \(\Omega= (\alpha_1,\dots, \alpha_n)\) be a tuple in \(\overline{k}^n\), of the \(n\) roots of \(f\), with some fixed order. Let \(x_1,\dots, x_n\) be ordered variables algebraically independent over \(k\). \textit{A. Valibouze} [Bull. Belg. Math. Soc. -- Simon Stevin 6, 507-535 (1999; Zbl 0943.12001)] introduced the notion of a Galois \((L,\Omega)\)-ideal in the ring \(k[x_1,\dots, x_n]\), associated to a subgroup \(L\) of the symmetric group \(S_n\). In the present paper it is proved that the Galois \((L,\Omega)\)-ideal containing the Galois group of \(f\) is generated by a separable triangular set of polynomials which forms a reduced Gröbner basis of this ideal for the lexicographical order. Triangular sets of polynomials are effective tools for solving algebraic systems. Using this the authors give an algebraic method for computing relative resolvents. Algorithms for computing characteristic polynomials and relative resolvents are given. If the Galois group of the polynomial \(f\) is known, their algorithm may be used for computing the ideal of relations among the roots of \(f\) and consequently for computations of the splitting field of \(f\). The algorithm for computing relative resolvents presented are illustrated in a concrete example of degree 8.
- Sur les relations entre les racines d'un polynôme
- Study of algebraic relations between the roots of a univariate polynomial
- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- scientific article; zbMATH DE number 2162681
- On constructing resolutions over the polynomial algebras
- On a method for finding the roots of an ideal
- On Invariant Relations between Zeros of Polynomials
- Sparse FGLM using the block Wiedemann algorithm
- Construction de corps de décomposition grace aux facteurs de résolvantes
- scientific article; zbMATH DE number 5270892
- A modular method for computing the Galois groups of polynomials
- A new efficient algorithm for computing Gröbner bases (F₄)
- Calcul de résolvantes avec les modules de Cauchy
- Calculs d'invariants primitifs de groupes finis
- Computational verification of M11and M12as galois groups over Q
- Computing Galois groups over the rationals
- Galois group computation for rational polynomials
- scientific article; zbMATH DE number 4137315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253969 (Why is no real title available?)
- scientific article; zbMATH DE number 1057746 (Why is no real title available?)
- scientific article; zbMATH DE number 1057767 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 806911 (Why is no real title available?)
- scientific article; zbMATH DE number 3196340 (Why is no real title available?)
- Lagrange resolvents
- Solving zero-dimensional algebraic systems
- Study of algebraic relations between the roots of a univariate polynomial
- Symmetric Functions, m-Sets, and Galois Groups
- The Determination of Galois Groups
- The transitive groups of degree up to eleven+
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Computation of the decomposition group of a triangular ideal
- Efficient arithmetic in successive algebraic extension fields using symmetries
- Study of algebraic relations between the roots of a univariate polynomial
- Computing strong regular characteristic pairs with Gröbner bases
- Galois theory, splitting fields and computer algebra
- On approximate triangular decompositions in dimension zero
- Change of order for regular chains in positive dimension
- A parallel multi-modular algorithm for computing Lagrange resolvents
- Parallel computation of resolvents by multimodular techniques and decomposition formula
- Algebraic computation of resolvents without extraneous powers
- New simple algorithms for computing the minimal polynomial of cos(2π/n)
- Algebraic certification of numerical algorithms computing Lagrange resolvents
- scientific article; zbMATH DE number 2162681 (Why is no real title available?)
- On the field intersection problem of solvable quintic generic polynomials
- Construction de corps de décomposition grace aux facteurs de résolvantes
- Calcul de résolvantes avec les modules de Cauchy
- Sur les relations entre les racines d'un polynôme
- Double classes, Galois ideals and resolvents
- Dynamic Galois theory
- Gröbner basis of the alternating Galoisian ideal
- Homotopy techniques for multiplication modulo triangular sets
- Bit-size estimates for triangular sets in positive dimension
This page was built for publication: Using Galois ideals for computing relative resolvents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5927988)
