GSoC 2013
Sage Project Proposals
Advanced Symbolic Expression Manipulation
Semidefinite Programming and sums of squares of real multivariate polynomials
Get Sage ready for Linux distributions (Debian)
Sage is a GPLed opensource mathematical software system. It is designed to be not just a computer algebra system, but more like a complete environment for doing mathematics and related calculations. It is based on a vast collection of existing opensource software tools and libraries and ties them together via Python. This is also the primary interface language for the user and its objectoriented way of expressing concepts is used to express calculations  of course, there are also many “normal” functions :) Behind the scenes, the Sage library executes the commands and calculations by its own algorithms or by accessing appropriate routines from the included software packages. On top of that, there are various ways how users can interact with Sage, most notably a dynamic website called “Notebook”.
All projects will start with an introduction phase to learn about Sage’s internal organization and to get used to its established development process. This is documented in the documentation for developers and all students will be instructed by the mentors on how to get their hands dirty. We use Mercurial for revision control and trac for organizing development and code review. Our license is GPLv2+. Feel free to contact Mentors before you send us project proposals, contact details are at the bottom. Feel free to introduce yourself and your project idea in our mailing list. To get a better feeling of Sage’s features, please check out the documentation, especially the thematic tutorials.
Student’s proposal template at the bottom.
This list of possible projects is organized into categories, starting with the webbased notebook interface.
The Sage Notebook is the primary graphical interface for Sage. It consists of a Pythonbased server backend evaluating the computations and a rich interactive Ajaxbased website. It has a user management, each user has a list of worksheets and each worksheet consists of cells that are evaluated on the server and the output is sent back to the website. The following batch of notebook specific proposals outline projects for improving the notebook on different levels.
The core team behind the notebook consists of several people who very welcome new contributors. You can access a Sage Notebook at www.sagenb.org or demo.sagenb.org, which has proven to be a very successful way of enabling average users to access an advanced mathematics suite online. Their dedicated mailing list is here.
Description  In the Sage Notebook, each user opens a worksheet to interact with Sage for doing mathematics. A worksheet is a list of alternating input/output cells. To actually do computations, one has to know about the commands and basic Python in order to do any calculations. Currently, a new user has to read the tutorial to get started, which needs time and is a barrier for new users. The aim of this project is to make it easier for novice users to actually use the notebook and help them entering common calculations. This could be done via several independent enhancements:

Mentor  Jason Grout backup: Dan Drake, William Stein 
Difficulty  Easy 
Skills 

Description  Currently, the ways to include data from other sources than the notebook itself is limited to the capabilities of Python (e.g. reading a CSV file via Python’s CSV module) The goal of this project is to make it easier to import and edit data in the form of simple spreadsheets and databases from within worksheets in the notebook.

Mentor  Jason Grout backup: Mike Hansen, William Stein 
Difficulty  Intermediate 
Skills 

Description  Sage’s 3d plots are dynamic: the user can zoom in and out and rotate the image. By contrast, 2d plots are static: the user can see a picture, but cannot zoom in on features of interest, zoom out to obtain a more global perspective, trace along the curve, or pan the view. The goal of this project is to add features like this to 2d plots, at least in the notebook view, making the notebook more suitable for educational purposes. 
Mentor  John Perry backup: William Stein 
Difficulty  Intermediate 
Skills 

Apart from the ones above, other project ideas are also welcome. Here is a selected list of ideas for your inspiration. Contact the possible mentors for more details.:
Description 

Mentor  Jason Grout, Mike Hansen, Dan Drake, William Stein discussion here: sagegsoc 
Difficulty  Easy to Intermediate, project could consist of one bigger project or several small and independent subprojects. 
Skills 

Right now Sage is installed on Windows machines as a VirtualBox virtual machine. This approach has some problems that makes some users desist in their intent to use Sage. We would need a simple GUI that deals with this issues. Namely, it should check the VirtualBox installation in the system, check the availability of connection ports, and handle the installed virtual machine status. In particular, it should run rhe virtual machine in headless mode if it is possible to connect from the local web browser.
See the discussion at https://groups.google.com/group/sagedevel/browse_thread/thread/a4808f2cf5b8b79f/03db2e576b21f42e?q=virtualbox&lnk=nl& about it.
Description  Write a GUI program to handle the VirtualBox VM. It should do something like the following:

Mentor  Volker Braun backup: Miguel Marco 
Difficulty  Medium 
Skills 

Working with Sage is not restricted to a local machine. The webinterface can be made public to other computers over the Intranet/Internet. One very successful example is http://demo.sagenb.org  this is the site behind the Google Chrome Web app for the Sage Notebook. After a bit more than a month of availability in the Chrome Web Store it had more than 2,000 users. Another example is the main Notebook site with more than 40,000 registered users. Sage not only wants to be a comprehensive software suite for mathematics but also wants to be easily accessible.
Consequently, we have to improve the inner parts of Sage to be able to scale for a much broader audience and satisfy online Notebook users from High School and University students doing their homework up to employees of engineering companies sharing their calculations with coworkers. These proposed enhancement projects could have a truly global impact and will certainly drive Sage’s further growth.
Description  Webserver, session management and Notebook storage. This project addresses the needs for a better scaling Notebook server. There are several layers to consider, each of them could be a project:
Those are just some of the cornerstones that need to be done to make the Sage Notebook more scalable. Interested applicants are expected to contact Jason Grout, who is currently organizing a larger project dedicated solely to this task. There has already been good progress on this project. Links: Notebook design 
Mentor  Jason Grout, William Stein backup: Dan Drake 
Difficulty  Hard 
Skills 

Description  Setting up a Sage Notebook server “right” is complicated. Although it is easy to start one instance for personal use, it is getting more complicated if it is set up for a classroom setting or as a worldwide server. This involves questions about security, sandboxing and scalability. In conjunction with other improvements, this project aims to make it easy to deploy a server for various applications. This includes the following tasks:

Mentor  Dan Drake backup: Jason Grout, William Stein 
Difficulty  Intermediate 
Skills 

Description  A unique feature of Sage is that it is able to communicate with essentially every other math software system out there, and some of that communication is fairly sophisticated, optimized, and debugged. However, the interfaces between Sage and the most popular commercial mathematics software systems  Mathematica, Maple, and Matlab  could all benefit from substantial additional work. They are buggy on certain platforms, don't deal well in some cases with large outputs, don't draw plots well, etc. Currently, the interfaces are all pseudotty based, but it may be possible in some cases to create alternative interfaces (with exactly the same API) that use proprietary socketbased protocols, e.g., MathLink (http://www.wolfram.com/solutions/mathlink/) for Mathematica. Now that the API of the Sage interfaces is very stable (after 7 years!), the goal of this project is to investigate and implement the best possible ways of implementing this API for each commercial math software system. 
Mentor  William Stein Backup: Mike Hansen 
Difficulty  Easy 
Skills  Very good knowledge of Python. 
Description  When people type "sage" to start Sage, it often takes a long time for Sage to startup. This is incredibly annoying. The main reason for this is that Python uses the stat system call to get basic information about files well over 50,000 times every single time Sage starts. This information is expensive to compute, and almost never changes. Thus it should be cached. Volker Braun has written a proof of concept patch that does such caching, but work remains. The goal of this project would be to finish that patch and get it included in Sage. Moreover, the project should go further and look at how to make that caching approach generic so it could be used by other projects outside Sage. This could have the potential impact of making "Python + scientific library" startup time better for millions of people. Make it so Python cache's module import locations on startup, thus greatly improving startup time for large Python modules. 
Mentor  William Stein Backup: Volker Braun 
Difficulty  Intermediate 
Skills  Very good knowledge of Python and C 
Piecewise functions are essential in approximation theory, numerical analysis, and throughout the classroom. Within a computer algebra system, they are invaluable for translating written mathematics in an understandable way to one’s domainspecific language.
Description  A full list of ideas (a work in progress) is available at the PiecewiseSymbolic SEP (Sage Enhancement Proposal)

Mentor  
Difficulty  Intermediate 
Skills 

Description  When working with symbolic expressions, manipulating them in a flexible way is essential. The goal of this project is to extend Sage's functionality of handling substitutions and patterns. This includes the following enhancements:

Mentor  Daniel Krenn 
Difficulty  Intermediate 
Skills 

Part of a sophisticated mathematical software system is a way to represent symbolic expressions and fast methods to manipulate them.
Description  Pynac/GiNaC is designed for symbolic computations. This project is about enhancing and optimizing this crucial and important part of Sage. Pynac replaces the numeric coefficients in GiNaC with python objects. The implementation should be extended to use machine longs and doubles as well as the GMP and MPFR libraries for multi precision integers, rationals and floating point numbers. This would provide a significant speed boost since using these types directly instead of the Python wrappers available in Sage is more efficient. The stubs to use other types as numeric objects are available in the code. The task involves writing the required interfaces to machine types, GMP and MPFR, as well as profiling typical operations to see where the bottlenecks are. 
Mentor  Burcin Erocal 
Difficulty  Intermediate 
Skills 

Description  Sage exposes mathematical functions to the user by wrapping lowerlevel libraries and algorithms. They occur in symbolic expressions and can be evaluated for given arguments. Some of them are not efficient, some of them could be improved and even some are not even exposed at all.

Mentor  Burcin Erocal backup: Martin Albrecht 
Difficulty  Intermediate 
Skills 

Combinatorics / Matroid theory
Description  matroids are combinatorial abstractions of a number of mathematical objects, including graphs and matrices. Sage will soon have support for matroids, but lots of work remains to be done. Some projects with high priority are: * Efficient routines for testing connectivity, and extending matroids while preserving connectivity * Computing the automorphism group of a matroid * More efficient minor testing * Build a framework for collections of matroids. This includes database support (for inspiration, look at Sage's Graph Database). 
Mentor  Stefan van Zwam Backup: Rob Beezer 
Difficulty  Intermediate (some mathematical maturity required) 
Skills 

Numerical Optimization
Description  Sage has general purpose classes to express and solve linear and mixedlinear optimization problems. The first aim of this project is to enhance the features of those classes and add more convenience for the user. Additionally, new classes for quadratic and continuous nonlinear optimization should be created. On the backend side, those classes interface with various specific solvers. This requires code to wrap their functionality or the necessary linking to certain libraries (e.g. which already provide Pythonbindings to solvers, and may have been already present in Sage, such as cvxopt). The second part of this project aims to add more cluecode for additional solvers. In this, it overlaps with the next topic, concerning semidefinite programming solvers and interfaces for them. 
Mentor  Dmitrii Pasechnik (for some parts) backup: Martin Albrecht 
Difficulty  Intermediate 
Skills 

Description  Improving the integration of semidefinite programming (and, potentially, other convex conic programming, e.g. 2nd order cone programming) solvers in Sage, creating an interface similar to what we already have for linear programming, hooking up more backends (currently, only cvxopt is integrated into Sage), with an aim to have a M*free environment for polynomial sums of squares modelling, such as done e.g. by MATLABbased YALMIP (http://users.isy.liu.se/johanl/yalmip/pmwiki.php?n=Main.WhatIsYALMIP). Potentially, it is a large project, as one can go quite far with developing modeling tools, adding symmetry treatment, etc. 
Mentor  Dima Pasechnik, Mehdi Ghasemi 
Difficulty  Intermediate to hard 
Skills 

M1RI
Description  M1RI, that's the code Tom wrote for dense linear algebra over GF(3), GF(5) and GF(7), i.e., small finite prime fields. This implementation is a collection of Sage worksheets at the moment, i.e. a proof of concept. From that we already know that this approach is very fast. Turning this into a proper library would be a huge benefit to the community. It requires C skills but most of the linear algebra business has been solved before, so the mathematics required is not that much. 
Mentor  Martin Albrecht backup: Burcin Erocal 
Difficulty  Intermediate 
Skills 

The traditional way of running Sage is via a “full” personal computer workstation. There are other form factors and devices from where Sage should be accessible, most notably tablets and smartphones. This involves running Sage on a remote server and designing a new user interface for interacting with it.
http://code.google.com/p/sageandroid/
Description  http://code.google.com/p/sageandroid/ No hard mathematics involved :) 
Mentor  Volker Braun backup: Harald Schilly 
Difficulty  Easy 
Skills 

Description  https://bitbucket.org/gvol/sageiphoneapp/

Mentor  Ivan Andrus 
Difficulty  Easy 
Skills 

Create a tool to check if there are any speed regressions between Sage releases.
Description  Sage uses the standard Python doctest framework to check for correctness. With more than 85% and increasing coverage these tests uncover many potential issues in new contributions. However, there is no equivalent mechanism to check if changes introduced to the Sage library cause speed regressions. There are standard solutions such as Codespeed to store timing information and display comparisons between different versions. This task involves:

Mentor  Burcin Erocal 
Difficulty  Intermediate 
Skills 

Description  Sage is currently shipped and built together with all its dependencies. Linux distributions package the dependencies separately (mainly done in Debian, see Wiki page) and want to obtain from the Sage website only Sage itself. The Sage build system currently only supports using all dependencies bundled with Sage. The idea is to enhance the Sage build system to accept a list of dependencies, for which the version provided by the OS is used instead of the bundled one. Given that Sage robustly supports this scenario, it will not be difficult to create a Debian package of Sage, which is another goal of this project. 
Mentor  Tobias Hansen (Debian) Jeroen Demeyer (Sage) John Palmieri (Sage) Julien Puydt 
Difficulty  Intermediate 
Skills 

This project is not directly related to Sage, but Maxima is an important component!
Description  Currently Maxima is exclusively meant for Symbolic computation with support lacking good Numerical facilities. The existing BLAS/LAPACK modules are based upon f2cled code in Common lisp, and hence performance is not portable (SBCL is probably 10x faster than CLisp). The goal of this project would be enhance Maxima's numerical capabilities by integrating parts of the Foreignfunctioninterface in Matlisp. One would then be able to interface with the compiled versions of BLAS/LAPACK, ODEPACK and also just about any other C/Fortran libraries. This would enhance Maxima's ability to do Numerical computation, and will open up new avenues like, implementing AutomaticDifferentiation, to be pursued later. 
Mentor  Raymond Toy 
Difficulty  Hard 
Skills 

Description  matroids are combinatorial abstractions of a number of mathematical objects, including graphs and matrices. Sage will soon have support for matroids, but lots of work remains to be done. Some projects with high priority are:

Mentor  Stefan van Zwam Backup: Rob Beezer 
Difficulty  Easy (programming), intermediate to hard (mathematics) 
Skills 

We recommend you to join our sagegsoc mailing list and introduce yourself and ask to help you for your submission.
We suggest you to introduce yourself and discuss your project idea in our mailing list. Only contact the possible mentors below if you have really specific questions!
Name  Topics  
Harald Schilly (Oversight)  general questions  harald+gsoc@schil.ly 
William Stein  Notebook, Backend 

Mentors  
Dan Drake  general projects  drake@kaist.edu 
Burcin Erocal  Symbolics, lowlevel Cython  burcin@erocal.org 
Jason Grout  Notebook, Backend  jasonsage@creativetrax.com 
Martin Albrecht  lowlevel Cython, crypto stuff, linear algebra  martinralbrecht@googlemail.com 
Mike Hansen  Notebook, general projects  mhansen@gmail.com 
Volker Braun  Android, Python, lowlevel Cython  vbraun.name@gmail.com 
Daniel Krenn  krenn@aon.at  
Ivan Andrus  iOS/iPhone App  darthandrus@gmail.com 
Alexander Dreyer  PolyBoRi  alexander.dreyer@itwm.fraunhofer.de 
Raymond Toy  Maxima  toy.raymond@gmail.com 
Dmitrii Pasechnik  Optimization, semidefinite programming  dimpase@gmail.com 
Tobias Hansen  Debian  thansen@debian.org 
Julien Puydt  Debian  julien.puydt@laposte.net 
John Palmieri  Debian  palmieri@math.washington.edu 
John Perry  Linear programming, commutative algebra, general  john.perry@usm.edu 
Miguel Marco  Algebra, PyQt  mmarco@unizar.es 
Stefan van Zwam  Matroid theory  svanzwam@math.princeton.edu 