Differences between revisions 1 and 23 (spanning 22 versions)
Revision 1 as of 2007-11-11 15:21:51
Size: 843
Editor: was2
Comment:
Revision 23 as of 2007-11-13 22:42:50
Size: 3272
Editor: JohnCremona
Comment:
Deletions are marked like this. Additions are marked like this.
Line 3: Line 3:
List any and all project ideas here. == Projects ==
 * elliptic curves (John, rpw, was)
  * getting g0n into Sage
  * sparse linear algebra over $F_q$
  * $\#E(F_q)$
Line 5: Line 9:
 * Number fields -- Reduction modulo a prime ideal, or any ideal.
 * Number fields --optimize K([1,2,3]).
 * multivariate polynomial quotient rings (Burcin, malb, Ludovic, Michael Brickenstein)
  * generic polynomial division/reduction
  * quotient rings via libSINGULAR
  * PolyBoRi integration
  * FGB integration
Line 8: Line 15:
 * Timing of doctests (partially done)  * coercion model/calculus/programming manual (robertwb, roed, John Hanke, Ondrey, David Loeffler, Jaap)
Line 10: Line 17:
 * Double question mark for spyx files doesn't work.; docstrings work.  * packages/updates/LinBox (cpernet, mabshoff)
  * LinBox bugfixes and updates
  * Givaro
  * IML
Line 12: Line 22:
 * Markup Cython code based on what C code it generates.  * benchmarketing (robertwb, Willem)
  * doctest benchmarking interface
Line 14: Line 25:
 * R Python expect interface
Line 16: Line 26:
 * Redo all the "edwards coord" proofs in Sage instead of Magma.
   See email to sagedays6, along with http://hyperelliptic.org/EFD/edwards.html
== Originally Proposed Projects ==
Line 19: Line 28:
 * Fix computing trace over F_q algebraically.  * (wstein and ondrej certik) [:/debian: determine exactly which sage packages are in debian]
Line 21: Line 30:
 * ATLAS into Sage.  * (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/prog_guide: Programming Guide]
Line 23: Line 32:
 * Linbox -- get rid of all the crappy hacks for minpoly/charpoly  * (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/coercion: Coercion]
Line 25: Line 34:
 * Linbox -- fix wrapping of smith_form problems.  * (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/calculus: Calculus]
Line 27: Line 36:
 * Create pickle database  * (wstein) upgrade the freetype package in sage.
Line 29: Line 38:
 * Document number fields.  * (wstein) upgrade the cvxopt package to 0.9
Line 31: Line 40:
 * Compute kernels of matrices over Z/p^nZ.  * (wstein) Number fields -- Reduction modulo a prime ideal, or any ideal.

 * (wstein) Number fields -- optimize K([1,2,3,4,5]), etc., for K number field or order.

 * (wstein) Timing of doctests (partially done)

 * (wstein) Double question mark for spyx files doesn't work.; docstrings work.

 * (wstein) Markup Cython code based on what C code it generates.

 * (wstein) R Python expect interface

 * (wstein) [:/edwards: Redo all the "edwards coord" proofs in Sage instead of Magma.]

 * (wstein) ATLAS into Sage on Linux.

 * (wstein) Linbox -- get rid of all the crappy hacks for minpoly/charpoly use in Sage.

 * (wstein) Linbox -- fix wrapping of smith_form problems in Sage.

 * (wstein) Create pickle database

 * (wstein) Document number fields.

 * (wstein) Compute kernels of matrices over $\mathbf{Z}/p^n\mathbf{Z}$.

 * (Ondrej Certik) simplify/improve calculus in SAGE [:/calculus: see this link for more info]

 * (mabshoff) fix BlasMatrix::Hom leak in LinBox

 * (mabshoff) start of 2.8.13 release cycle

 * (david harvey) try to improve cache efficiency of NTL's FFT routine

 *(Bill Allombert) improve PARI ECM implementation

 * (john.cremona) adapt interface to new Simon gp scripts

 * (john.cremona) elliptic curve isomorphisms, urst transforms of curves and points

 * (john.cremona) improved $\#E(F_q^d)$ for elliptic curves defined over $F_q$

 * (malb) speed up $GF(p^n)$ for $p \neq 2$ and $p^n \geq 2^{16}$ (using NTL::ZZ_pE and NTL::zz_pE)

 * (malb) implement quotient rings over multivariate polynomial rings over finite fields using libSINGULAR

 * (malb) implement multivariate polynomial rings over number fields using libSINGULAR

 * --((malb) implement sparse matrices over $GF(p^n)$ (using Givaro) modelled after sparse matrices modint.)--

 * (weinmann) related to malb's point directly above: merge smatlib code into SAGE.

 * (weinmann) extend MPolynomialSystemGenerator such that equation systems for (stream and block) ciphers can be generated in a generic way.

Sage Days 6 Coding Sprints

Projects

  • elliptic curves (John, rpw, was)
    • getting g0n into Sage
    • sparse linear algebra over F_q

    • \#E(F_q)

  • multivariate polynomial quotient rings (Burcin, malb, Ludovic, Michael Brickenstein)
    • generic polynomial division/reduction
    • quotient rings via libSINGULAR
    • PolyBoRi integration

    • FGB integration
  • coercion model/calculus/programming manual (robertwb, roed, John Hanke, Ondrey, David Loeffler, Jaap)
  • packages/updates/LinBox (cpernet, mabshoff)
    • LinBox bugfixes and updates

    • Givaro
    • IML
  • benchmarketing (robertwb, Willem)
    • doctest benchmarking interface

Originally Proposed Projects

  • (wstein and ondrej certik) [:/debian: determine exactly which sage packages are in debian]
  • (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/prog_guide: Programming Guide]
  • (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/coercion: Coercion]
  • (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/calculus: Calculus]
  • (wstein) upgrade the freetype package in sage.
  • (wstein) upgrade the cvxopt package to 0.9
  • (wstein) Number fields -- Reduction modulo a prime ideal, or any ideal.
  • (wstein) Number fields -- optimize K([1,2,3,4,5]), etc., for K number field or order.
  • (wstein) Timing of doctests (partially done)
  • (wstein) Double question mark for spyx files doesn't work.; docstrings work.
  • (wstein) Markup Cython code based on what C code it generates.
  • (wstein) R Python expect interface
  • (wstein) [:/edwards: Redo all the "edwards coord" proofs in Sage instead of Magma.]
  • (wstein) ATLAS into Sage on Linux.
  • (wstein) Linbox -- get rid of all the crappy hacks for minpoly/charpoly use in Sage.
  • (wstein) Linbox -- fix wrapping of smith_form problems in Sage.
  • (wstein) Create pickle database
  • (wstein) Document number fields.
  • (wstein) Compute kernels of matrices over \mathbf{Z}/p^n\mathbf{Z}.

  • (Ondrej Certik) simplify/improve calculus in SAGE [:/calculus: see this link for more info]
  • (mabshoff) fix BlasMatrix::Hom leak in LinBox

  • (mabshoff) start of 2.8.13 release cycle
  • (david harvey) try to improve cache efficiency of NTL's FFT routine
  • (Bill Allombert) improve PARI ECM implementation
  • (john.cremona) adapt interface to new Simon gp scripts
  • (john.cremona) elliptic curve isomorphisms, urst transforms of curves and points
  • (john.cremona) improved \#E(F_q^d) for elliptic curves defined over F_q

  • (malb) speed up GF(p^n) for p \neq 2 and p^n \geq 2^{16} (using NTL::ZZ_pE and NTL::zz_pE)

  • (malb) implement quotient rings over multivariate polynomial rings over finite fields using libSINGULAR
  • (malb) implement multivariate polynomial rings over number fields using libSINGULAR
  • (malb) implement sparse matrices over GF(p^n) (using Givaro) modelled after sparse matrices modint.

  • (weinmann) related to malb's point directly above: merge smatlib code into SAGE.
  • (weinmann) extend MPolynomialSystemGenerator such that equation systems for (stream and block) ciphers can be generated in a generic way.

days6/sprint (last edited 2010-10-29 04:29:46 by DanDrake)