-
-
Notifications
You must be signed in to change notification settings - Fork 554
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
implement is_squarefree for p-adic rings #23525
Comments
comment:2
I did not run any doctests yet (still rebuilding sage.) New commits:
|
Author: Julian Rüth |
Commit: |
comment:3
Maybe we should just raise a |
comment:4
I think it makes sense to return mathematically correct answers even if they are trivial. It means that you can write algorithms without checking for trivial cases. E.g., we do this already to determine whether a polynomial is squarefree: first we check whether it's content is squarefree. A trivial check over fields, but still the correct thing to do. So currently we need to protect this check with a |
comment:5
PS: I think it really depends on who are you writing code for. Beginners will be surprised that
but eventually you are going to learn that parents are very important in Sage… |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:7
Okay, we had some more discussion on IRC and I'm fine with this now. Positive review once tests pass. |
comment:8
The only failure is the intermittent
which is already addressed by #23554. |
Reviewer: David Roe |
Changed branch from u/saraedum/implement_is_squarefree_for_p_adic_rings to |
Currently, this does not work
CC: @roed314
Component: padics
Author: Julian Rüth
Branch/Commit:
3875877
Reviewer: David Roe
Issue created by migration from https://trac.sagemath.org/ticket/23525
The text was updated successfully, but these errors were encountered: