Sage-Combinat workshop in Orsay
January 26-30 of 2009
Purpose: work on the foundations and get former MuPAD-Combinat developers on board. See below for details.
Sponsored by the Laboratoire de Mathématiques d'Orsay:
Like for the previous MuPAD-Combinat days of June 2006, I (NicolasThiéry) have rented a 8-person house in Cernay-la-Ville (la tour). We did the cooking ourselves (bring your favorite recipes!). Altogether this made for a tight budget (around 1200 euros total for 5 days and 8 persons).
Coming from downtown Paris
- From Gare Montparnasse: 35 minutes train to Rambouillet + 15 minutes bus to Cernay-la-Ville
- From Chatelet-les-Halles: 45 minutes RER B to Saint-Remy les Chevreuses + 15 minutes bus to Cernay-la-Ville
Time tables Saint-Remy <-> Cernay <-> Rambouillet:
We will do some car shuttles from Saint Rémi. Please contact us in advance to synchronize. NicolasThiéry' phone: 06 77 90 32 79
- Monday morning 10am on the parking of Saint-Rémi de Chevreuse
NicolasBorie, doctorant, Orsay
- Sébastien Labbé, doctorant, Université du Québec à Montréal, Canada
- Adrien Boussicault, doctorant, Institut Gaspard Monge, Université de Marne-la-Vallée
- Vincent Delecroix, doctorant, Institut de Mathématiques de Luminy, Marseille
- Franco Saliola, Post-doc, Institut Gaspard Monge, Université de Marne-la-Vallée
NicolasThiéry, MdC, Orsay
- Thomas Fenrique, CR, Laboratoire d'Informatique Fondamentale, Univ. Marseille
FlorentHivert, Prof, LITIS, Université de Rouen
Sage-Combinat History and development -- (NicolasThiéry)
The new category framework -- Design and usage (NicolasThiéry)
Root system plots -- Demo (NicolasBorie)
Word paths and/or Equations on words -- Demo (Sébastien Labbé)
Interval Exchange Transformation and Linear Involution (Vincent Delecroix)== Suggested Topics ==
Altogether, the meeting was really successful, with lots of code written (90 commits), and many many design discussions. Here are some of the points that were worked on:
Words: see the sprint page
Interval Exchange Transformation and Linear Involution (Vincent Delecroix)
Patch a first version of code for the combinatoric of interval exchange transformations and their generalizations. It will be a hard task to choose names because standards one are Permutation and GeneralizedPermutation which are confusing ! Perhaps IETPermutation... but not very beautiful.
Patch Server Guide -- Write a better guide for the patch server. It's currently way too long, and a shorter, concise version would be better. [1st version DONE see step by step instructions ]
- the posets code in Sage needs to be re-designed to integrate properly with the rest of sage-combinat.
- design discussions for abstract larger/lazy/infinite posets
- Design and naming convention discussions
- Put it to intensive use: the NCSF and representation theory projects will be perfect for this
- Mike Zabrocki sent me (Franco) an implementation of noncommutative symmetric functions in Sage. I'll have it with me at the meeting to share and discuss. (It's not on the patch server because he finds the instructions complicated, which brings to the patch server point).
Representation Theory of Finite Dimensional Algebras and monoids
- a basic class for the quiver of an algebra
- core work: subspaces and quotients for combinatorial free modules, and corresponding category framework
- Finish the basic implementation of representation theory of monoids via J-classes
DiscreteMonoid implemented via lists instead of matrices
deal with more of the quirks and weirdness issues.
Set Partition (with no s) -- Implement Set Partition as a child of Set Partitions. Use the code from Disjoint Set which is already in the sage-combinat tree. See trac #5039. (Sébastien Labbé).
- Fix Anne's bug with Partitions(0)