676
Comment:
|
2233
|
Deletions are marked like this. | Additions are marked like this. |
Line 3: | Line 3: |
== Saturday schedule: == * 9:00 a.m. trac/review a patch example * 10:00 a.m. projects * 5:00 p.m. status reports |
== Saturday (Sept 5) == * 9:00 a.m. getting started on trac * 10:30 a.m. projects * 5:00 p.m. status reports == Sunday (Sept 6) == * 9:00 a.m. review a patch example * 10:00 a.m. project work * 5:00 p.m. status reports |
Line 9: | Line 14: |
* Writing documentation | * Writing/fixing documentation: fixing typos * git command should be git -command |
Line 11: | Line 17: |
* ABC project * Modular forms project * Combinatorics patches * L-functions * Sister Celine's algorithm code |
* ABC project (Lily, Kristin, Aly) * Modular forms project (Jackie, Aly, Lubjana) * Combinatorics patches (Emily, Nadia) * 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 * Recurrences for hypergeometric sums - Sister Celine's algorithm code (Karen) * https://www.math.upenn.edu/~wilf/AeqB.html * http://mathworld.wolfram.com/SisterCelinesMethod.html * Analytic rank for elliptic curve L-functions (Michelle) * Newton's method bug (Amy) * Discrete Gaussian sampler bug (Kristin, Amy) * http://trac.sagemath.org/ticket/17764 * http://trac.sagemath.org/ticket/19138 * Sturm sequences/ Weil polynomials (Alina) - patch in FLINT * Power sums of roots of polynomials (Alina) - implement it in Sage (goal: beat pari) |
Line 17: | Line 34: |
== Trac Tickets == * I think these are relatively easy * http://trac.sagemath.org/ticket/3709 * http://trac.sagemath.org/ticket/1422 * http://trac.sagemath.org/ticket/5728 * http://trac.sagemath.org/ticket/6106 * Not 100% sure if the tickets below here are easy, but they look easier than others? * http://trac.sagemath.org/ticket/4204 * Ones that should possibly be closed? * http://trac.sagemath.org/ticket/5091 |
Sage Days 69: Women in Sage 6 (September 4-9, 2015)
Saturday (Sept 5)
- 9:00 a.m. getting started on trac
- 10:30 a.m. projects
- 5:00 p.m. status reports
Sunday (Sept 6)
- 9:00 a.m. review a patch example
- 10:00 a.m. project work
- 5:00 p.m. status reports
Projects:
- Writing/fixing documentation: fixing typos
- git command should be git -command
- Reviewing patches
- ABC project (Lily, Kristin, Aly)
- Modular forms project (Jackie, Aly, Lubjana)
- Combinatorics patches (Emily, Nadia)
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
- Recurrences for hypergeometric sums - Sister Celine's algorithm code (Karen)
- Analytic rank for elliptic curve L-functions (Michelle)
- Newton's method bug (Amy)
- Discrete Gaussian sampler bug (Kristin, Amy)
- Sturm sequences/ Weil polynomials (Alina) - patch in FLINT
- Power sums of roots of polynomials (Alina) - implement it in Sage (goal: beat pari)
Trac Tickets
- I think these are relatively easy
- Not 100% sure if the tickets below here are easy, but they look easier than others?
- Ones that should possibly be closed?
Organizers: Jennifer Balakrishnan, Alyson Deines
Participants:
- Jen Berg
- Lubjana Beshaj
- Alina Bucur
- Amy Feaver
- Emily Gunawan
- Lily Khadjavi
- Karen Kohl
- Michelle Kovesi
- Kristin Lauter
- Nadia Lafrenière
- Jackie Lang
- Mélodie Lapointe
- Stéphanie Schanck