Algebraic computation of resolvents without extraneous powers

DOI10.1016/j.ejc.2012.03.003zbMath1288.68290OpenAlexW1986626290MaRDI QIDQ444389

Annick Valibouze, Philippe Aubry

Publication date: 14 August 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.003

zbMATH Keywords

resolventresultantabsolute resolventrelative resolvent

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items

PARALLEL COMPUTATION OF RESOLVENTS BY MULTIMODULAR TECHNIQUES AND DECOMPOSITION FORMULA

Cites Work

• Unnamed Item
• Unnamed Item
• Gröbner basis of the alternating Galoisian ideal
• Functional decomposition of polynomials: the tame case
• Computing Galois groups over the rationals
• Study of algebraic relations between the roots of a univariate polynomial
• Fast Algorithms for Manipulating Formal Power Series
• The Determination of Galois Groups
• Calcul de résolvantes avec les modules de Cauchy
• Sur les relations entre les racines d'un polynôme
• Polynomial decomposition algorithms
• Using Galois ideals for computing relative resolvents