Differences between revisions 7 and 9 (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 7 as of 2015-09-05 16:45:00 → 
  Size: 829
  Editor: egunawan
  Comment:
+   ← Revision 9 as of 2015-09-05 17:24:11 → ⇥
  Size: 1169
  Editor: aly.deines
  Comment:
-Deletions are marked like this.
+Additions are marked like this.
 Line 5:
- * 10:00 a.m. projects
+ * 10:35 a.m. projects
 * 1:00 p.m. review a patch
-Line 14:
+Line 15:
-   * http://trac.sagemath.org/ticket/18003
+   * 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 16:
+Line 19:
  * Sister Celine's algorithm code