Computing all power integral bases in orders of totally real cyclic sextic number fields
Mathematics of Computation
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Hi-index | 0.00 |
Given an irreducible polynomial P ∈ Z[X] of degree at least three and 0 ≠ a ∈ Z we are going to determine all those monic quadratic polynomials Q ∈ Z[X] satisfying Res(P,Q) = a. This is the first attempt for the complete resolution of resultant type equations. We illustrate our algorithm with a detailed example.