Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Trac #21331: Make Roth-Ruckenstein algorithm a method of polynomials
The coding part of Sage (see #18846) contains Roth-Ruckenstein algorithm to compute the roots of a polynomial `Q(y)` with coefficients in `F[x]` (where `F` is a finite field). The purpose of this ticket is to move the implementation to make this algorithm a method of polynomials. Toward this end, we also define a generic implementation for roots of univariate polynomials over univariate polynomial rings, that goes through their factorization. And this requires to implement the factorization for these "recursive" polynomial rings: Currently, the algorithm consists in flattening the recursive polynomial ring and use methods for multivariate polynomial rings. URL: https://trac.sagemath.org/21331 Reported by: bruno Ticket author(s): Bruno Grenet Reviewer(s): Turku Ozlum Celik
- Loading branch information
Showing
5 changed files
with
219 additions
and
391 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.