Sage Days 23.5 Coding Sprint Projects
Contents
-
Sage Days 23.5 Coding Sprint Projects
- Singular Parallel Build
- Doctest the Free Algebra Quotient code
- Letterplace
- error: out of memory
- Relative number field arithmetic
- Delete a function related to multivariate polynomial factorization from Sage
- Gröbner bases in Sage: Optional parameters
- extend polynomial rings mod 2^n to n > 30
- big exponents
- Sage Nagbot could Doctest some tickets
Singular Parallel Build
Trac #9497: Fix the Singular spkg so it can take advantage of building in parallel. But fix Singular SPKG first (3-1-1-3)!
Doctest the Free Algebra Quotient code
The file SAGE_ROOT/devel/sage/sage/algebras/free_algebra_quotient.py has no doctests. Get it to 100% coverage. The point of this is that it is related to wrapping something like letterplace.
Letterplace
Do a very basic wrapping of letterplace for Sage. Use this to replace some of the lame old code in the SAGE_ROOT/devel/sage/sage/algebras/ directory.
error: out of memory
Trac #5313. Patch singular so that when it runs out of memory the error message says "singular" in it. Moreover, replace the exit(1) or whatever by something that can be trapped via _sig_on/_sig_off.
Relative number field arithmetic
- Arithmetic in relative numbers fields is sometimes very slow. This could be done using multivariate polynomial ring quotients via libsingular, which would be extremely fast in some cases. There is some cleverness that I do *not* know how to do for inverting elements -- hence it would be good to do this here with singular people around.
Delete a function related to multivariate polynomial factorization from Sage
This is trac 9498. There is a stupid function that William Stein wrote during bug days, which may as well be removed.
Gröbner bases in Sage: Optional parameters
In Singular, one can use various options (redTail, e.g.) and also a degree bound (degBound) for Gröbner basis computations. Aim: Allow the same for libSingular, and also introduce a decorator that can be used for methods that use the Singular expect interface: Save the current options and set a certain value when entering the function, and reset the options when leaving. In other words: Fix #1396!!
extend polynomial rings mod 2^n to n > 30
Rings mod 2^n are limited to n <= 30, but we'd like to have n<=62 by using longs. This would be relevant for some crypto applications
big exponents
Provide an interface to use Singular monomials with big exponents (64-bit instead of 16-bit)
Simon King mentioned that sometimes his code crashes/leaks/etc. So make it so one can do:
@fork
def f(x,y,z,...):
...and then f gets computed in a blocking forked process, and the result is returned via pickling. This is 100% to thwart mem leaks, segfaults, and guaranteed timeout possibility. This could be basically just a light wrapper around @parallel(1). Also, make a global flag to turn this off, so @fork does nothing.
Sage Nagbot could Doctest some tickets
The Sage Nagbot could be made able to run doctests for a ticket, say in the one obvious case where there is precisely one patch attached to the ticket, and it is set to "needs review". The nagbot code is here.