Algebraic computation of resolvents without extraneous powers (Q444389)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algebraic computation of resolvents without extraneous powers |
scientific article; zbMATH DE number 6065702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algebraic computation of resolvents without extraneous powers |
scientific article; zbMATH DE number 6065702 |
Statements
Algebraic computation of resolvents without extraneous powers (English)
0 references
14 August 2012
0 references
resolvent
0 references
resultant
0 references
absolute resolvent
0 references
relative resolvent
0 references
A resolvent of a polynomial \(p\) is another polynomial whose roots are expressed as a function of the roots of \(p\). The resolvent is said to be absolute if it is invariant under permutations of the roots of \(p\) and it is called relative otherwise.NEWLINENEWLINEThe paper presents a symbolic method for computing relative resolvents. The method uses suitable resultant computations in a multivariate polynomial ring. The algorithm significantly improves on a previous version of the same authors, by controlling the swell of intermediate expressions. As a byproduct results a method, based on the Girard-Newton relations for symmetric functions, for determining an \(r\)-th root of a polynomial.NEWLINENEWLINEThe paper cites 17 references.
0 references