id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
21331,Make Roth-Ruckenstein algorithm a method of polynomials,bruno,,"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.",enhancement,closed,major,sage-7.4,commutative algebra,fixed,"sd75, polynomial, root finding",jsrn dlucas,,Bruno Grenet,Turku Ozlum Celik,N/A,,01378dcfdc19033ae5a6d755e75b315176e0656d,01378dcfdc19033ae5a6d755e75b315176e0656d,,