-
-
Notifications
You must be signed in to change notification settings - Fork 453
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
problem with _mpoly_dict_recursive() #2601
Comments
comment:1
I don't know what's happening, but maybe the following simpler example will help someone figure it out:
Note also that out of the 6 permutations of 'a, b, c', only 'c, b, a' and 'b, c, a' throw this exception; the other 4 seem to work properly. |
comment:2
I believe the problem is in _mpoly_dict_recursive() in multi_polynomial.pyx:
This should return {(0, 0, 1): 1}. I'm having trouble understanding exactly how the code works so I'm giving up on trying to fix this. Someone familiar with the code should be able to do this properly, and much faster than me. |
Attachment: trac_2601.patch.gz |
comment:5
Looks good to me. |
comment:6
Merged in Sage 3.3.alpha3 |
The following produces errors:
although this does not:
Component: commutative algebra
Keywords: ideal, change_ring
Issue created by migration from https://trac.sagemath.org/ticket/2601
The text was updated successfully, but these errors were encountered: