Sage Days 16 Project Idea Page

Implement evaluation of elliptic curve isomorphism at a point

PEOPLE: William Stein

sage: E = EllipticCurve('37a'); F = E.quadratic_twist(-17)
sage: K.<a> = QuadraticField(-17); E = E.change_ring(K); F = F.change_ring(K)
sage: phi = E.isomorphism_to(F); phi(E.gens()[0])
Traceback (click to the left for traceback)
NotImplementedError: not implemented.

Create a Cython class for points on elliptic curves and optimize basic arithmetic

PEOPLE: William Stein

Create elliptic curve classes for elliptic curve models in the Explicit-Formulas Database

PEOPLE: David Kohel

See the EFD:

Rewrite abelian groups (hard)

PEOPLE: William Stein

Optimize/better document/generally improve graph theory library in Sage

PEOPLE: Robert Miller

Cliquer SPKG for Sage

PEOPLE: Robert Miller, Nathann Cohen (remotely)

Take a look at the possibility of making GAP a dynamically loadable library

PEOPLE: Robert Miller, Martin Albrecht (hopefully)

Python implementation of Ford-Fulkerson algorithm

PEOPLE: Robert Miller

I plan on at least copying the Python implementation on wikipedia, since now we have nothing at all for max flow problems. Hopefully then someone who really cares about it will try to use it, realize it is slow, start improving it, etc. etc. etc.

Frobenius number and genus of numerical semigroups using toric Grobner bases

PEOPLE: Bjarke Hammersholt Roune