Add a gcd algorithm for univariate polynomials over number fields using pari

[lftabera]

This ticket is a split of #8558 to simplify reviewing and partial merging.

Currently, gcd of polynomials over absolute number fields uses euclidean algorithm. This patch changes that and makes the gcd using internal pari routines. This is not optimal for high degree number fields. See #8558 for an improvement.

Component: algebra

Keywords: gcd, univariate polynomial, pari

Author: Luis Felipe Tabera Alonso

Branch/Commit: fe4328d

Reviewer: Peter Bruin

Issue created by migration from https://trac.sagemath.org/ticket/15803

[lftabera]

Branch: u/lftabera/gcd_number_field_pari

[lftabera]

Commit: bb677fc

[jdemeyer]

comment:3

For the documentation (in particular the indentation of it), please follow the format from http://www.sagemath.org/doc/developer/coding_basics.html#documentation-strings

[jdemeyer]

comment:4

Can you make polynomial rings using the PolynomialRing constructor instead of the R[x] construct (which isn't really meant for Sage library use).

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

341a8f7

Use proper constructions for the library. Minor fixes in other parts of the code.

[sagetrac-git]

Changed commit from bb677fc to 341a8f7

[lftabera]

comment:6

I have changed the use of R[x] and some small fixes.