7783
Comment:

← Revision 40 as of 20130706 05:15:37 ⇥
10310

Deletions are marked like this.  Additions are marked like this. 
Line 3:  Line 3: 
Preliminary Schedule ==================== 
Final Schedule for Sage Days 38 =============================== **Morning sessions** will will include talks, tutorials and open presentations. **Afternoon sessions** will be dedicated to working on the exercises from the tutorials, coding sprints, followup discussions, etc. **Status reports**: There will be a status report every day at 17h00. 
Line 9:  Line 16: 
* 9 am: Welcome, and Sage installation help * 10am11am : `Sage overview (presentation, demo, SageCombinat) <attachment:20110502SageDays30.pdf>`_ (Franco + Nicolas) * 11am12pm: coffee break at University Club (next door), Introductions, more Sage installations Lunch Break * [the afternoon sessions may start later to accommodate time for lunch  please stay tuned for updates] * 1pm: Tutorial: `Using the Sage notebook and navigating the help system <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialnotebookandhelplong.html>`_ (Jason) [`helpnotebook sws file <attachment:Tutorial_help_notebook_long.sws>`_] * 2pm: Tutorial: `Doing the first exercises from Project Euler <http://projecteuler.net>`_ (Jason). See also the `List tutorial <http://combinat.sagemath.org/doc/thematic_tutorials/siena_tutorials/Worksheet02Lists.html>`_ [`list sws file <attachment:list_tutorial.sws>`_] * 3pm: coffee break * 3:15pm: Open tutorials (Anne, Jason, Florent, Franco, Nicolas): * Tutorial: `Linear algebra <http://combinat.sagemath.org/doc/thematic_tutorials/siena_tutorials/Worksheet06LinearAlgebra.html>`_ (Franco) [`linear algebra sws file <attachment:Linear_algebra.sws>`_] * Tutorial: `Combinatorics <http://combinat.sagemath.org/doc/reference/sage/combinat/tutorial_enumerated_sets.html>`_ (Jason) [`combinatorics sws file <attachment:combinatorics.sws>`_] * Tutorial: `Words <http://combinat.sagemath.org/doc/reference/sage/combinat/words/demo.html>`_ [`words sws file <attachment:words.sws>`_] * Other resources: * `The Sage tutorial <http://www.sagemath.org/doc/tutorial/>`_ * `Sage thematic tutorials and demos <http://combinat.sagemath.org/doc/thematic_tutorials/>`_ * Introductory book in French: `Introduction à Sage <http://sagebook.gforge.inria.fr/>`_ 
**Morning Session**: * 08h30 : Coffee & Croissants * 09h00 : `Welcome and Introduction to Sage`_ (`source files`_), Sébastien Labbé * 10h00 : Coffee Break * 10h30 : Tour de Table and Installations, Franco Saliola * 11h30 : `Tutorial I`_ : *Using the Sage notebook and navigating the help system*, Franco Saliola **Lunch Break**: 12h30  14h30 **Afternoon Session**, 14h3017h30: * 14h30 : `Tutorial II`_ : *Calculus and Linear Algebra in Sage* * 15h30 : Coffee Break * 16h00 : Coding Sprints * 17h00 : Status Reports **Buffet at CRM**: 17h30  18h30 **Special event**: *Installation Party*, 18h30 After the buffet, we will continue with informal discussions, coding sprints and we will troubleshoot any problems encountered in the installations during the morning session. 
Line 37:  Line 45: 
* 9am9:30am: Tutorial: `Programming in Python and Sage <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialprogrammingpython.html>`_ (Franco/Jason) [`programming tutorial sws file <attachment:programming_python_sage.sws>`_] * Worksheet: `The 3n+1 Conjecture <http://combinat.sagemath.org/doc/thematic_tutorials/siena_tutorials/Worksheet05CollatzConjecture.html#sienatutorialsworksheet05collatzconjecture>`_ [`Collatz conjecture sws file <attachment:collatz_conjecture.sws>`_] * Worksheet: `Strings and the BurrowsWheeler Transform <http://combinat.sagemath.org/doc/thematic_tutorials/siena_tutorials/Worksheet07StringsAndTheBWT.html#sienatutorialsworksheet07stringsandthebwt>`_ [`strings and BurrowsWheeler sws file <attachment:stringsburrowswheeler.sws>`_] * 9:30amnoon: Anne's giving an introduction to implementations for crystal categories. * 10:30am: coffee break * 11am: Tutorial: `Editing Sage's Sources <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialeditingsagesources.html>`_ Lunch break * 2pm: Anders: "Strategies for computing Schubert structure constants" * 3:15pm: coffee break * 3:30pm: Tutorial: how to kindly report a bug or suggest an improvement (20 minutes) * 3:35pm: Coding sprint organization * 4pm: Coding sprints 
**Morning Session**: * 08h30 : Coffee & Croissants * 09h00 : `Øyvind Solberg`__, *Quivers and Path Algebras  QPA* (`slides`__ and `demo`__) *Abstract*. We will give an introduction representation theory of quivers, defining quivers (directed graphs), representations of quivers and maps between representations of quivers. Further to recall basic constructions involving these objects like direct sum, kernels, special representations, etc. Representations of quivers are central for representation theory of finite dimensional algebras, and we will try to describe some of the basic problems. Next we describe the QPA project by describing the background, aims and goals, current status, design and algorithms, and main future projects. We will end with a short demonstration of the QPA program, hopefully run via an interface developed by students at HiST/NTNU. __ http://www.math.ntnu.no/~oyvinso/ __ http://wiki.sagemath.org/days38_schedule?action=AttachFile&do=view&target=solbergslides.pdf __ http://wiki.sagemath.org/days38_schedule?action=AttachFile&do=view&target=solberggapdemo.g * 10h00 : Coffee Break * 10h30 : Nicolas M. Thiéry, *A SageCombinat roadmap* *Abstract.* In this talk, we will present the SageCombinat project, whose mission is "to improve Sage as an extensible toolbox for computer exploration in (algebraic) combinatorics, and foster code sharing between researchers in this area". After a brief tour of its history and development model, we will focus on its roadmap, opening a discussion on what mid to long term goals could be, depending on interest and available work forces. * 11h30 : `Meinolf Geck`__, *High performance computations around KazhdanLusztig cells* *Abstract.* We present the computer algebra package PyCox, written entirely in Python and compatible with Sage, for computations with finite Coxeter groups and Hecke algebras. It includes some new variations of the traditional algorithms for computing KazhdanLusztig cells (which now work up to type E_7) and distinguished involutions (which even work in type E_8). __ http://www.abdn.ac.uk/~mth190/ **Lunch Break**: 12h30  14h30 **Afternoon Session**, 14h3017h30: * 14h30 : `Tutorial III`_: *Programming in Python and Sage*, Florent Hivert * 15h30 : Coffee Break * 17h00 : Status Reports 
Line 59:  Line 102: 
* 9am9:30: Sign up for `projects <days30_projects>`_ and short meetings; presentations of work so far (students and others) * 9:3010:45am: Tutorial: `Object oriented programming <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialobjectsandclasses.html>`_ (FlorentHivert) [`tutorialobjectsandclasses sws file <attachment:tutorialobjectsclasses.sws>`_] * 9:30am: concurrent development projects: Scheicher and Thuswaldner algorithm, subspaces, posets * 10:45am: coffee break * 11am11:20am: Tutorial: `programming iterators <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialiterators.html>`_ [`tutorialiterators sws file <attachment:tutorialiterators.sws>`_] (FlorentHivert) Lunch break * 1:30pm: concurrent development projects: actions * 3pm: coffee break * 3:30pm: concurrent development projects: IntegerVectors, crystals, dcomplete posets * 5pm: Coding sprint status report * 5:30pm: ultimate frisbee (most likely on the NW dyke field  directions will be provided) 
**Morning Session**: * 08h30 : Coffee & Croissants * 09h00 : Derek Ruths, `Introducing Zen: the ZeroEffort Network Library for Python`_ *Abstract.* This talk will introduce a new python library for network analysis and algorithmics. As datasets increase in size and algorithms demand increasing amounts of resources, it is critically important for network libraries to be efficient and performant. Few libraries available for Python (or any other platform for that matter) deliver this kind of efficiency: few can load massive network datasets or execute intensive algorithms on them. Of those that can, efficiency comes at a cost to ease of use. We don't believe that this compromise is necessary. Designed from scratch, the Zen library aims to provide the fastest, most memory efficient network routines without compromising good pythonic conventions. To date it's benchmarked network functions match or beat the fastest network libraries available in Python. In this talk, we will give a brief introduction to network analysis, discuss the design elements of Zen that make it both fast and easytouse, briefly overview its functionality, and discuss opportunities for integration and use with Sage. * 10h00 : Coffee Break * 10h30 : Anne Schilling, *Markov chains for promotion operators*, (`Sage worksheet`__) *Abstract.* Schuetzenberger introduced a promotion operator on arbitrary finite posets. Using a slight extension of these operators, one can define a Markov chain on all linear extensions of the poset. This generalizes the Tsetlin library which corresponds to the antichain. With Sage, we can investigate the stationary distributions and eigenvalues of the transition matrix. For rooted forests we find that the resulting monoid is Rtrivial, which leads to a generalization of Brown's theory of Markov chains for left regular bands. This is based on mathematical explorations with Arvind Ayyer and Steven Klee, and the patch `Trac 12536`_ with Nicolas Thiery. __ http://wiki.sagemath.org/days38_schedule?action=AttachFile&do=view&target=schillingmarkov.sws * 11h00 : Viviane Pons, *Bases of multivariate polynomials*, (`Sage worksheet`__) *Abstract.* We have developed a patch in sage to consider multivariate polynomials as formal sums of vectors. Each vector corresponds to the exponent of a monomial. From simple operations on vectors, we obtain operations on the polynomials. We define the *divided differences* and we explain how they can be used to generate linear bases of the ring of multivariate polynomials. We show that they can be seen as a generalization of the Schur basis of symmetric polynomials. __ http://wiki.sagemath.org/days38_schedule?action=AttachFile&do=view&target=ponsworksheet.sws * 11h30 : `Tutorial IV`_: *Contributing to Sage*, Anne Schilling **Lunch Break**: 12h30  14h30 **Afternoon Session**, 14h3017h30: exercises and coding sprints with coffee break and status reports * 15h30 : Coffee Break * 17h00 : Status Reports 
Line 76:  Line 166: 
* 10am: coffee break * 10:15am12:15pm: Series of Tutorial: `Contributing to Sage <http://combinat.sagemath.org/doc/thematic_tutorials/demohowtocontribute.html>`_ [`contribute to sage sws file <attachment:contributetosage.sws>`_] `How to contribute <http://www.liafa.jussieu.fr/~labbe/Sage/howtocontribute/>`_  Using and programming sage from the command line (Christian)  Creating a patch (Nicolas)  Reviewing a patch (Anne and Franco) `Short stepbystep checklist <https://www.evernote.com/shard/s16/sh/f30e5eb970a94882818b333c690942bf/d7a138e2705c25b8da6e2053950a89d5>`_  Sage combinat installation (Florent) * 2pm: Coding sprint status report * 2:30pm: Robert Smith `Equivalence in Computer Algebra <attachment:talkRobertSmith.pdf>`_ * 3pm: coffee break * 5:30pm: local weekly pickup ultimate frisbee, President's Field (on the campus map: between field 46 (Raymond Field, fencedin fancy field), building 48 (Festival Theatre, a former arena, so looks like one), and behind white house 47 (Alumni Hall administrative offices, formerly the university president's house)) 
**Morning Session**: * 08h30 : Coffee & Croissants * 09h00 : Open Presentations * 10h00 : Coffee Break * 10h30 : Open Presentations * 11h30 : `Tutorial V`_: *Cython*, Florent Hivert **Lunch Break**: 12h30  14h30 **Afternoon Session**, 14h3017h30: exercises and coding sprints with coffee break and status reports * 15h30 : Coffee Break * 17h00 : Status Reports 
Line 96:  Line 184: 
 fill out travel reimbursement forms  TBA * 10am: coffee break * 10:15am11:15am: Tutorial: Contributing to Sagecombinat `Mercurial step by step <http://wiki.sagemath.org/combinat/MercurialStepByStep>`_ Illustrated by `the outdated picture <http://wiki.sagemath.org/combinat/Mercurial?action=AttachFile&do=get&target=patchserver.png>`_ .. image:: http://wiki.sagemath.org/combinat/Mercurial?action=AttachFile&do=get&target=patchserver.png :height: 250px Lunch break * submit code for student contribution prize by 1pm * 2pm: Coding sprint status report * 3pm: coffee break Potential material  * Tutorial: `Using algebraic structures: vector spaces, ... <http://combinat.sagemath.org/doc/reference/sage/modules/tutorial_free_modules.html>`_ (Jason Bandlow, Florent Hivert, Nicolas Thiéry) * Tutorial:: `Implementing your own algebraic structures <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialimplementingalgebraicstructures.html>`_ (Jason Bandlow, Floren Hivert, Nicolas Thiéry) * Tutorial:: `Graph theory <http://wwwsop.inria.fr/members/Nathann.Cohen/tut/Graphs/>`_ * Tutorial:: `Linear programming <http://wwwsop.inria.fr/members/Nathann.Cohen/tut/LP/>`_ * Tutorial/demo:: `Symmetric functions <http://combinat.sagemath.org/doc/thematic_tutorials/demosymmetricfunctions.html>`_ * Tutorial: cluster algebras (Christian) * Tutorial: Crystal bases (Anne) * Tutorial: Posets (Franco) * Tutorial: Parents, Elements, Categories (Nicolas Thiéry) * Lexicographic generation of lists of integers (Florent Hivert, Nicolas Thiéry) Algorithmic & design * Canonical forms, normal forms, and computer representation (Robert Smith) * Schubert calculus: challenges, solutions, projects * Various algebras in Sage (Hecke algebra, nilCoxeter, Temperley Lieb, local plactic) (Anne) Discussions  * Thematic tutorials setup * Categories * The SageCombinat roadmap * The SageCombinat workflow: writing the specs * Modeling set containment: "x in S" see `Discussion about Containment in Sage <http://wiki.sagemath.org/ContainmentDiscussion>`_ * Posets, ideals/upper set Development Projects  See the `projects <days30_projects>`_ page. 
**Morning Session**: * 08h30 : Coffee & Croissants * 09h00 : Open Presentations * 10h00 : Coffee Break * 10h30 : Open Presentations **Lunch Break**: 11h30  13h30 * 13h30 : Doron Zeilberger: n\ :sup:`n2`\ **Afternoon Session**, 14h3017h30: exercises and coding sprints with coffee break and status reports * 15h30 : Coffee Break * 17h00 : Status Reports Open Presentations ================== Open presentations are quick (5 to 15 minutes) presentations done by the participants. It can be demonstrations of projects done during the week. Or it can be about anything of interest to the participants including software useful for teaching or research. Thursday :  Using sagetex to generate of math homeworks, by Nicolas Thiéry (`zip file with example`__) __ http://wiki.sagemath.org/days38_schedule?action=AttachFile&do=view&target=demoexamsheetwithsage.zip  interact demo, by Mélodie  animate demo, by Michael Friday :  `sagetex Tutorial`_, by Pierre Cagne  WebWorK and Sage integration, by Malcolm  `Tutorial V`_: *Cython Part 2*, by Florent Hivert  `Python Coding Convention`_, by Sébastien Labbé Not done yet :  a demo of the new IPython 0.12 Notebook, by Pierre Cagne  What's new with Python 2.7 recently included into Sage?, by ???  some interact made by Florent  pgfplots + gnuplot, by Alexandre Blondin Massé  tikz2pdf, by Sébastien Labbé .. _`Introducing Zen: the ZeroEffort Network Library for Python` : http://zen.networkdynamics.org/wpcontent/uploads/2012/05/20120509_SageDays38.pdf .. _`Welcome and Introduction to Sage`: http://thales.math.uqam.ca/~labbes/Sage/201205days38.pdf .. _`source files`: http://sage.math.washington.edu/home/slabbe/days38talk/ .. _`Tutorial I`: days38_tutorials#tutorialiusingthesagenotebookandnavigatingthehelpsystem .. _`Tutorial II`: days38_tutorials#tutorialiicalculusandlinearalgebrainsage .. _`Tutorial III`: days38_tutorials#tutorialiiiprogramminginpythonandsage .. _`Tutorial IV`: days38_tutorials#tutorialivcontributingtosage .. _`Tutorial V`: days38_tutorials#tutorialvcython .. _`Trac 12536`: http://trac.sagemath.org/sage_trac/ticket/12536 .. _`sagetex Tutorial`: http://sagemath.org/doc/tutorial/sagetex.html .. _`Python Coding Convention`: http://www.sagemath.org/doc/developer/conventions.html 
Final Schedule for Sage Days 38
Morning sessions will will include talks, tutorials and open presentations.
Afternoon sessions will be dedicated to working on the exercises from the tutorials, coding sprints, followup discussions, etc.
Status reports: There will be a status report every day at 17h00.
Monday
Morning Session:
 08h30 : Coffee & Croissants
 09h00 : Welcome and Introduction to Sage (source files), Sébastien Labbé
 10h00 : Coffee Break
 10h30 : Tour de Table and Installations, Franco Saliola
 11h30 : Tutorial I : Using the Sage notebook and navigating the help system, Franco Saliola
Lunch Break: 12h30  14h30
Afternoon Session, 14h3017h30:
 14h30 : Tutorial II : Calculus and Linear Algebra in Sage
 15h30 : Coffee Break
 16h00 : Coding Sprints
 17h00 : Status Reports
Buffet at CRM: 17h30  18h30
Special event: Installation Party, 18h30
After the buffet, we will continue with informal discussions, coding sprints and we will troubleshoot any problems encountered in the installations during the morning session.
Tuesday
Morning Session:
08h30 : Coffee & Croissants
09h00 : Øyvind Solberg, Quivers and Path Algebras  QPA (slides and demo)
Abstract. We will give an introduction representation theory of quivers, defining quivers (directed graphs), representations of quivers and maps between representations of quivers. Further to recall basic constructions involving these objects like direct sum, kernels, special representations, etc. Representations of quivers are central for representation theory of finite dimensional algebras, and we will try to describe some of the basic problems.
Next we describe the QPA project by describing the background, aims and goals, current status, design and algorithms, and main future projects.
We will end with a short demonstration of the QPA program, hopefully run via an interface developed by students at HiST/NTNU.
10h00 : Coffee Break
10h30 : Nicolas M. Thiéry, A SageCombinat roadmap
Abstract. In this talk, we will present the SageCombinat project, whose mission is "to improve Sage as an extensible toolbox for computer exploration in (algebraic) combinatorics, and foster code sharing between researchers in this area". After a brief tour of its history and development model, we will focus on its roadmap, opening a discussion on what mid to long term goals could be, depending on interest and available work forces.
11h30 : Meinolf Geck, High performance computations around KazhdanLusztig cells
Abstract. We present the computer algebra package PyCox, written entirely in Python and compatible with Sage, for computations with finite Coxeter groups and Hecke algebras. It includes some new variations of the traditional algorithms for computing KazhdanLusztig cells (which now work up to type E_7) and distinguished involutions (which even work in type E_8).
Lunch Break: 12h30  14h30
Afternoon Session, 14h3017h30:
 14h30 : Tutorial III: Programming in Python and Sage, Florent Hivert
 15h30 : Coffee Break
 17h00 : Status Reports
Wednesday
Morning Session:
08h30 : Coffee & Croissants
09h00 : Derek Ruths, Introducing Zen: the ZeroEffort Network Library for Python
Abstract. This talk will introduce a new python library for network analysis and algorithmics. As datasets increase in size and algorithms demand increasing amounts of resources, it is critically important for network libraries to be efficient and performant. Few libraries available for Python (or any other platform for that matter) deliver this kind of efficiency: few can load massive network datasets or execute intensive algorithms on them. Of those that can, efficiency comes at a cost to ease of use. We don't believe that this compromise is necessary. Designed from scratch, the Zen library aims to provide the fastest, most memory efficient network routines without compromising good pythonic conventions. To date it's benchmarked network functions match or beat the fastest network libraries available in Python. In this talk, we will give a brief introduction to network analysis, discuss the design elements of Zen that make it both fast and easytouse, briefly overview its functionality, and discuss opportunities for integration and use with Sage.
10h00 : Coffee Break
10h30 : Anne Schilling, Markov chains for promotion operators, (Sage worksheet)
Abstract. Schuetzenberger introduced a promotion operator on arbitrary finite posets. Using a slight extension of these operators, one can define a Markov chain on all linear extensions of the poset. This generalizes the Tsetlin library which corresponds to the antichain. With Sage, we can investigate the stationary distributions and eigenvalues of the transition matrix. For rooted forests we find that the resulting monoid is Rtrivial, which leads to a generalization of Brown's theory of Markov chains for left regular bands. This is based on mathematical explorations with Arvind Ayyer and Steven Klee, and the patch Trac 12536 with Nicolas Thiery.
11h00 : Viviane Pons, Bases of multivariate polynomials, (Sage worksheet)
Abstract. We have developed a patch in sage to consider multivariate polynomials as formal sums of vectors. Each vector corresponds to the exponent of a monomial. From simple operations on vectors, we obtain operations on the polynomials. We define the divided differences and we explain how they can be used to generate linear bases of the ring of multivariate polynomials. We show that they can be seen as a generalization of the Schur basis of symmetric polynomials.
11h30 : Tutorial IV: Contributing to Sage, Anne Schilling
Lunch Break: 12h30  14h30
Afternoon Session, 14h3017h30: exercises and coding sprints with coffee break and status reports
 15h30 : Coffee Break
 17h00 : Status Reports
Thursday
Morning Session:
 08h30 : Coffee & Croissants
 09h00 : Open Presentations
 10h00 : Coffee Break
 10h30 : Open Presentations
 11h30 : Tutorial V: Cython, Florent Hivert
Lunch Break: 12h30  14h30
Afternoon Session, 14h3017h30: exercises and coding sprints with coffee break and status reports
 15h30 : Coffee Break
 17h00 : Status Reports
Friday
Morning Session:
 08h30 : Coffee & Croissants
 09h00 : Open Presentations
 10h00 : Coffee Break
 10h30 : Open Presentations
Lunch Break: 11h30  13h30
 13h30 : Doron Zeilberger: n^{n2}
Afternoon Session, 14h3017h30: exercises and coding sprints with coffee break and status reports
 15h30 : Coffee Break
 17h00 : Status Reports
Open Presentations
Open presentations are quick (5 to 15 minutes) presentations done by the participants. It can be demonstrations of projects done during the week. Or it can be about anything of interest to the participants including software useful for teaching or research.
Thursday :
 Using sagetex to generate of math homeworks, by Nicolas Thiéry (zip file with example)
interact demo, by Mélodie
animate demo, by Michael
Friday :
 sagetex Tutorial, by Pierre Cagne
 WebWorK and Sage integration, by Malcolm
 Tutorial V: Cython Part 2, by Florent Hivert
 Python Coding Convention, by Sébastien Labbé
Not done yet :
 a demo of the new IPython 0.12 Notebook, by Pierre Cagne
 What's new with Python 2.7 recently included into Sage?, by ???
 some interact made by Florent
 pgfplots + gnuplot, by Alexandre Blondin Massé
 tikz2pdf, by Sébastien Labbé