Differences between revisions 6 and 8 (spanning 2 versions)

Sage Days 69: Women in Sage 6 (September 4-9, 2015)

Saturday schedule:

Writing documentation
Reviewing patches
ABC project
Modular forms project
Combinatorics patches
- Finish fully packed loop class http://trac.sagemath.org/ticket/18003
- Create a snake graph class (using part of the code already written for on http://trac.sagemath.org/ticket/16310)
  - a snake graph is a connected sequence of square tiles which goes north and east http://www.northeastern.edu/martsinkovsky/p/MADL/2013/slides-canakci.pdf
L-functions
Sister Celine's algorithm code
- https://www.math.upenn.edu/~wilf/AeqB.html
- http://mathworld.wolfram.com/SisterCelinesMethod.html

Organizers: Jennifer Balakrishnan, Alyson Deines

Participants:

-  ⇤ ← Revision 6 as of 2015-09-05 16:42:55 → 
  Size: 725
  Editor: ktkohl
  Comment:
+   ← Revision 8 as of 2015-09-05 16:57:05 → ⇥
  Size: 1140
  Editor: egunawan
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 14:
+   * Finish fully packed loop class http://trac.sagemath.org/ticket/18003
   * Create a snake graph class (using part of the code already written for on http://trac.sagemath.org/ticket/16310)
      * a snake graph is a connected sequence of square tiles which goes north and east http://www.northeastern.edu/martsinkovsky/p/MADL/2013/slides-canakci.pdf
-Line 15:
+Line 18:
  * Sister Celine's algorithm code
-Line 17:
+Line 20:
+   * http://mathworld.wolfram.com/SisterCelinesMethod.html