-
-
Notifications
You must be signed in to change notification settings - Fork 596
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
multivariate factorization over finite fields #11829
Comments
comment:2
Looks like we raise a NotImplementedError also in the polydict implementation:
|
Author: Martin Albrecht |
comment:3
The attached patch throws an error if a factorisation with a modulus > 2^29 is requested. |
comment:4
Martin, just curious: why did next_prime(229) raise an error and not previous_prime(231)? Paul, now checking the doctests still pass... |
comment:5
Hi Paul, a multivariate polynomial ring over GF(next_prime(229)) uses libSingular, i.e., Singular via a Cython interface; while a multivariate polynomial ring over GF(previous_prime(231)) uses the generic polynomial implementation in Sage. We followed the Singular manual for the maximum prime allowed (which is 2147483629 < previous_prime(231)), while we apparently don't follow it when converting generic polynomials to Singular via the pexpect interface. I think this is actually a bug and the Singular developers meant previous_prime(231) when they chose a limit. I asked: http://groups.google.com/group/libsingular-devel/browse_thread/thread/885b21e6f8039cc |
comment:6
Martin, I asked Hans Schonemann last week at the MAGIX conference about this limit, and he Paul |
comment:7
Paul, there's a limit of 229 for factoring, gcds etc. everything that has to do with factory. There is another limit of ~ 231 for Singular itself: polynomial arithmetic, GBs etc. |
comment:8
All doctests pass, thus if the limits are ok, I will give a positive review. Paul |
comment:9
Okay, previous_prime(231) is what is correct (confirmed with Hans). Hence, I changed the bound in |
Reviewer: Paul Zimmermann |
comment:10
All doctests pass except the following timeout with sage 4.7.1 (but this timeout also happens
Thus a positive review for me. Paul |
comment:11
argh, I screwed up and didn't upload the most recent patch. Sorry! I'll upload the new patch in a second. |
comment:12
Attachment: trac11829_factor_too_large.patch.gz |
comment:13
All doctests still pass with the new version (with the same timeout). Paul |
This comment has been minimized.
This comment has been minimized.
comment:15
Replying to @zimmermann6:
Guess you're on Ubuntu (10.04.3 for example); this is due to a known issue with its kernel and the PExpect interface. (You'll notice that the doctest idles most of the time.) |
comment:16
yes I'm on Ubuntu. Paul |
Merged: sage-4.7.2.alpha3 |
As far as I know, Sage calls Singular for multivariate factorization over finite fields. Currently Singular is limited to primes less than
2^29:
However for larger primes we get:
and this seems to hang (when I hit Ctrl-C, it says
Interrupting Singular
)Apply attachment: trac11829_factor_too_large.patch to the Sage library.
CC: @malb @simon-king-jena
Component: factorization
Author: Martin Albrecht
Reviewer: Paul Zimmermann
Merged: sage-4.7.2.alpha3
Issue created by migration from https://trac.sagemath.org/ticket/11829
The text was updated successfully, but these errors were encountered: