-
-
Notifications
You must be signed in to change notification settings - Fork 568
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
refactor squarefree_decomposition to allow different rings to chose different implementations #13008
Comments
Branch: u/saraedum/ticket/13008 |
This comment has been minimized.
This comment has been minimized.
Author: Julian Rueth |
Changed keywords from polynomial, squarefree to polynomial, squarefree, sd59 |
comment:7
Looks good & we discussed the design decision. New commits:
|
Commit: |
Reviewer: Martin Albrecht |
Changed branch from u/saraedum/ticket/13008 to |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Refactor
squarefree_decomposition()
of univariate polynomials to call_squarefree_decomposition_univariate()
of the base ring. This makes it easier to have different algorithms in different rings.This will make it easier to implement square-free decomposition over perfect fields and separably generated extensions of perfect fields.
Also, the implemented algorithms only work for some base fields. The checks are now more specific.
Depends on #12404
Depends on #13048
Component: algebra
Keywords: polynomial, squarefree, sd59
Author: Julian Rueth
Branch/Commit:
29264c6
Reviewer: Martin Albrecht
Issue created by migration from https://trac.sagemath.org/ticket/13008
The text was updated successfully, but these errors were encountered: