7783
Comment:

6997

Deletions are marked like this.  Additions are marked like this. 
Line 3:  Line 3: 
Preliminary Schedule ==================== 
Preliminary 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 
**Morning Session**: 
Line 14:  Line 18: 
Lunch Break  * 08h30 : Coffee & Croissants * 09h00 : *Welcome and Introduction to Sage*, 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 
Line 16:  Line 24: 
* [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). 
**Lunch Break**: 12h30  14h30 
Line 21:  Line 26: 
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): 
**Afternoon Session**, 14h3017h30: 
Line 25:  Line 28: 
* 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: 
* 14h30 : Tutorial II : *Calculus and Linear Algebra in Sage* * 15h30 : Coffee Break * 16h00 : Coding Sprints * 17h00 : Status Reports 
Line 30:  Line 33: 
* `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/>`_ 
**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 44: 
* 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>`_]  **Morning Session**: 
Line 39:  Line 46: 
* 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>`_]  * 08h30 : Coffee & Croissants * 09h00 : Øyvind Solberg, *Quivers and Path Algebras  QPA* 
Line 41:  Line 49: 
* 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>`_]  *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. 
Line 43:  Line 57: 
* 9:30amnoon: Anne's giving an introduction to implementations for crystal categories.  Next we describe the QPA project by describing the background, aims and goals, current status, design and algorithms, and main future projects. 
Line 45:  Line 61: 
* 10:30am: coffee break * 11am: Tutorial: `Editing Sage's Sources <http://combinat.sagemath.org/doc/thematic_tutorials/tutorialeditingsagesources.html>`_ 
We will end with a short demonstration of the QPA program, hopefully run via an interface developed by students at HiST/NTNU. 
Line 48:  Line 64: 
Lunch break  * 10h00 : Coffee Break * 10h30 : Nicolas M. Thiéry, *A SageCombinat roadmap* 
Line 50:  Line 67: 
* 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 
*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 
Line 59:  Line 95: 
* 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) 
**Morning Session**: 
Line 65:  Line 97: 
Lunch break  * 08h30 : Coffee & Croissants * 09h00 : Derek Ruths, *Introducing Zen: the ZeroEffort Network Library for Python* 
Line 67:  Line 100: 
* 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) 
*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* *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. * 11h30 : Viviane Pons, *Multivariate Polynomials in Sage* *Abstract.* À venir. * 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 146: 
* 10am: coffee break  **Morning Session**: 
Line 78:  Line 148: 
* 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/>`_ 
* 08h30 : Coffee & Croissants * 09h00 : Open Presentations * 10h00 : Coffee Break * 10h30 : Open Presentations * 11h30 : Tutorial V: *Cython*, Florent Hivert 
Line 83:  Line 154: 
 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) 
**Lunch Break**: 12h30  14h30 
Line 88:  Line 156: 
* 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)) 
**Afternoon Session**, 14h3017h30: exercises and coding sprints with coffee break and status reports * 15h30 : Coffee Break * 17h00 : Status Reports 
Line 96:  Line 164: 
 fill out travel reimbursement forms  TBA  **Morning Session**: 
Line 98:  Line 166: 
* 10am: coffee break * 10:15am11:15am: Tutorial: Contributing to Sagecombinat `Mercurial step by step <http://wiki.sagemath.org/combinat/MercurialStepByStep>`_ 
* 08h30 : Coffee & Croissants * 09h00 : Open Presentations * 10h00 : Coffee Break * 10h30 : Open Presentations * 11h30 : Open Presentations 
Line 101:  Line 172: 
Illustrated by `the outdated picture <http://wiki.sagemath.org/combinat/Mercurial?action=AttachFile&do=get&target=patchserver.png>`_  **Lunch Break**: 12h30  14h30 
Line 103:  Line 174: 
.. image:: http://wiki.sagemath.org/combinat/Mercurial?action=AttachFile&do=get&target=patchserver.png :height: 250px 
**Afternoon Session**, 14h3017h30: exercises and coding sprints with coffee break and status reports 
Line 106:  Line 176: 
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. 
* 15h30 : Coffee Break * 17h00 : Status Reports 
Preliminary 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, 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
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
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.
11h30 : Viviane Pons, Multivariate Polynomials in Sage
Abstract. À venir.
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
 11h30 : Open Presentations
Lunch Break: 12h30  14h30
Afternoon Session, 14h3017h30: exercises and coding sprints with coffee break and status reports
 15h30 : Coffee Break
 17h00 : Status Reports