|
Size: 2480
Comment:
|
← Revision 72 as of 2011-01-10 11:39:30 ⇥
Size: 5561
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| Week of 26-30 of January 2009 | January 26-30 of 2009 |
| Line 5: | Line 5: |
| 3-4 days depending on the last minutes constraints of the participants. | Purpose: work on the foundations and get former MuPAD-Combinat developers on board. See below for details. |
| Line 7: | Line 7: |
| Purpose: work on the foundations (Hopf algebra infrastructure, ...) and get former MuPAD-Combinat developers on board | Sponsored by the Laboratoire de Mathématiques d'Orsay: {{attachment:logo_UFR.png|Faculté d'Orsay|width=100}} |
| Line 9: | Line 9: |
| == Accomodation == Like for the previous MuPAD-Combinat days of June 2006, I (NicolasThiéry) have rented a 8-person house in Cernay-la-Ville ([[http://www.cernayvacances.com/CFrans.html|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). {{attachment:img1.jpg|Photo 1|width=400}} {{attachment:img2.jpg|Photo 2|width=400}} == 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: [[http://www.savac.fr/fr/transports/pdf/horaires_2008/horaire_039_039_103_2009.pdf|39.103]] [[http://www.savac.fr/fr/transports/pdf/horaires_2008/horaire_039_039_03_2009.pdf|39.003]] [[http://www.savac.fr/fr/transports/pdf/horaires_2008/horaire_039_039_303_2009.pdf|39.303 express]] There are two bus stops at Cernay, the closest is Grand'Place, near the gite. BEWARE: there are no busses between 7:35am and noon! * 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 * ... * [[http://maps.google.fr/maps?f=q&source=s_q&hl=fr&geocode=&q=Cernay+la+ville&sll=47.15984,2.988281&sspn=17.161007,44.516602&ie=UTF8&ll=48.675731,1.971735&spn=0.004066,0.010868&z=17|Map and and aerial photo]] |
|
| Line 12: | Line 40: |
| Please fill in below whether and how long you would like to participate, and which period is convenient: | * 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 |
| Line 14: | Line 49: |
| * NicolasThiéry: not 5-9 of January, not 4-6 of February * Michael Abshoff: gone for SD 12, i.e. Jan 20th-26th * Sébastien Labbé: between 25th-31st of January * Nicolas Borie : not 5-9 of January. * FrancoSaliola: I can (and will) participate for the whole week. * Florent Hivert: not 29th of January * Jean-Christophe Novelli: only 27-28 of January possible * Adrien Boussicault * Vincent D: "I have three days free (26-28) during which I will come to Orsay" |
== Short talks == |
| Line 24: | Line 51: |
| == Suggested Topics == | * '''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 == |
| Line 26: | Line 57: |
| Add topics that you want discuss or work on. Add your name next to anything you'd like to participate with. Your name should at least appear next to the topics you suggest :-) | == Work done == |
| Line 28: | Line 59: |
| * '''Words''' -- Improvements to the words code, discussions regarding the trac #5002, finish and post words_new_fct_sl.patch to trac. (FrancoSaliola, Sébastien Labbé) * '''NCSF''' -- Mike Zabrocki sent me 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 me to the next point.) (FrancoSaliola) * '''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. (FrancoSaliola, Sébastien Labbé) * '''Posets''' -- the posets code in Sage needs to be re-designed to integrate properly with the rest of sage-combinat (FrancoSaliola). * '''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 (Sébastien Labbé). * '''Word Paths''' -- Final improvements to word paths, get the patch posted to trac and reviewed. (Sébastien Labbé). * '''Dyck Word''' -- Discussions about getting Dyck Words inherits from Word Paths. Comparisons of efficiency. (Sébastien Labbé). * '''Desosseur''' -- Computing the Cartan invariant and more generally representation theory of finite dimensional algebras (FlorentHivert, FrancoSaliola). |
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 [[http:SageCombinatWorkshopOrsay/WordsSprint|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. '''Documentation''' * '''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 [[http:/combinat/MercurialStepByStep|step by step instructions]] ] ''' * '''User's Guide''' -- descriptions of and how to use the fundamental sage-combinat data structures: CombinatorialClass, CombinatorialObject, CombinatorialFreeModule, Categories, Family, ... '''Posets''' (FrancoSaliola) * 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 '''Categories''' (NicolasThiéry) * Design and naming convention discussions * Put it to intensive use: the NCSF and representation theory projects will be perfect for this '''NCSF''' * 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''' * '''Desosseur''' -- Computing the Cartan invariant and more generally representation theory of finite dimensional algebras (FlorentHivert, FrancoSaliola). * 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 '''Miscellaneous''' * deal with more of the [[http://wiki.sagemath.org/combinat/Weirdness|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) |
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: 
Accomodation
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:
39.103 39.003 39.303 express There are two bus stops at Cernay, the closest is Grand'Place, near the gite. BEWARE: there are no busses between 7:35am and noon!
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
- ...
Participants
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
Short talks
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 ==
Work done
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.
Documentation
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 ]
User's Guide -- descriptions of and how to use the fundamental sage-combinat data structures: CombinatorialClass, CombinatorialObject, CombinatorialFreeModule, Categories, Family, ...
Posets (FrancoSaliola)
- 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
Categories (NicolasThiéry)
- Design and naming convention discussions
- Put it to intensive use: the NCSF and representation theory projects will be perfect for this
NCSF
- 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
Desosseur -- Computing the Cartan invariant and more generally representation theory of finite dimensional algebras (FlorentHivert, FrancoSaliola).
- 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
Miscellaneous
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)