 |
École polytechnique Open archive |  |
 |
Algorithms for the universal decomposition algebra
Abstract : Let k be a field and let f be a polynomial of degree n in k [T]. The symmetric relations are the polynomials in k [X1, ..., Xn] that vanish on all permutations of the roots of f in the algebraic closure of k. These relations form an ideal Is; the universal decomposition algebra is the quotient algebra A := k [X1, ..., Xn]/Is. We show how to obtain efficient algorithms to compute in A. We use a univariate representation of A, i.e. an explicit isomorphism of the form A=k [T]/Q (T), since in this representation, arithmetic operations in A are known to be quasi-optimal. We give details for two related algorithms, to find the isomorphism above, and to compute the characteristic polynomial of any element of A.
Cited literature [38 references]
https://hal-polytechnique.archives-ouvertes.fr/hal-00669806
Contributor : Romain Lebreton <>
Submitted on : Tuesday, February 14, 2012 - 4:52:00 PM
Last modification on : Thursday, March 5, 2020 - 6:24:48 PM
Long-term archiving on: : Thursday, November 22, 2012 - 12:25:30 PM
Contributor : Romain Lebreton <>
Submitted on : Tuesday, February 14, 2012 - 4:52:00 PM
Last modification on : Thursday, March 5, 2020 - 6:24:48 PM
Long-term archiving on: : Thursday, November 22, 2012 - 12:25:30 PM
File
Algorithms_for_the_universal_d...
Files produced by the author(s)