implement padic (x)gcd for fixed mod polynomials

[saraedum]

Polynomials over the padics only implement an incorrect (x)gcd, see #13439. The attached patch provides a correct implementation for polynomials over fixed modulus rings.

Depends on #13629
Depends on #13442
Depends on #13539
Depends on #13626
Depends on #13627

Component: padics

Keywords: days71, sd87

Author: Julian Rueth

Branch/Commit: u/saraedum/ticket/13630 @ 183f87d

Reviewer: Aly Deines

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

[saraedum]

Changed dependencies from #13629, #13442 to #13629, #13442, #13539

[saraedum]

Changed dependencies from #13629, #13442, #13539 to #13629, #13442, #13539, #13626, #13627

[saraedum]

Attachment: trac_13630.patch.gz

[nilesjohnson]

Branch: u/niles/ticket/13630

[nilesjohnson]

comment:5

rebased to sage 6.0 and converted to git branch; no other changes

merges cleanly in local repository in spite of what trac says

---

Last 10 new commits:

e3315d8	Trac #13626: implemented gcd for padics
c3df981	Trac #13441: refactored gcd to not use _gcd calls anymore
aab8e2e	Merge branch 'ticket/13441' into ticket/13626
5b6e9c6	Trac #13628: refactored xgcd to not use _xgcd calls anymore.
f66e7a2	Merge branch 'ticket/13628' into ticket/13627
da9b384	Trac #13627: implemented xgcd for padics
861d698	Trac #13629: rings can provide _xgcd_univariate_polynomial for xgcd computations
b7fcb0b	Merge branch 'ticket/13629' into ticket/13630
b3eee8a	Trac #13442: rings can provide _gcd_univariate_polynomial for polynomial factorization
abc6b02	Merge branch 'ticket/13442' into ticket/13630

[nilesjohnson]

Commit: c4b3743