Differences between revisions 42 and 43
Revision 42 as of 2009-01-23 19:54:51
Size: 7378
Comment:
Revision 43 as of 2009-01-23 22:55:15
Size: 7380
Comment:
Deletions are marked like this. Additions are marked like this.
Line 24: Line 24:
   BEWARE: there are no busses between 7:35am and 12 am!    BEWARE: there are no busses between 7:35am and 12:00pm!

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.

Accomodation

Like for the previous MuPAD-Combinat days of June 2006, I (Nicolas) have rented a 8-person house in Cernay-la-Ville (la tour). Hopefully, this will be paid for by the university of Orsay; otherwise we will split the charges (~600 euros total). We will do the cooking ourselves (bring your favorite recipes!).

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 12:00pm!

  • We will do some car shuttles from Saint Rémi. Please contact us in advance to synchronize. NicolasThiery' phone: 06 77 90 32 79

    • Monday morning 10am on the parking of Saint-Rémi de Chevreuse (Nicolas Borie: 06 89 29 78 44)
    • ...
  • Map and and aerial photo

Schedule

We will start on Monday at 10:30 with an introductory talk. The following days, we will start at 10 am, with a short talk. On monday morning, we will setup a more detailed schedule for each topic, and post it here.

Participants

Please fill in below whether and how long you would like to participate:

  • NicolasThiéry: I'll be there most of the time except Tuesday

  • Sébastien Labbé: between 25th-31st of January
  • Nicolas Borie:
  • 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 Delecroix: I will participate three days (26-28) and perhaps whole week
  • Michael Abshoff: available online

Suggested Topics

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 :-)

Words (FrancoSaliola, Sébastien Labbé, Vincent Delecroix)

  • ideas for improving to the code (Stream for infinite words?) (Vincent Delecroix)
  • discussions regarding the trac #5002
  • finish and post words_new_fct_sl.patch to trac #5037
  • create a Lyndon word class
  • trac #4954: Words_over_Alphabet should check the type of input alphabet
  • Add Generalized Thue-Morse words to words.[TAB]
  • Add Random Word and Random Testing
  • Add Notes about words library
  • Word Paths -- Final improvements to word paths, get the patch posted to trac #5038 and reviewed. Discussion about getting Christoffel Words inherits from Word Paths. (Sébastien Labbé).

  • Dyck Word -- Discussions about getting Dyck Words inherits from Word Paths. Comparisons of efficiency. (Sébastien Labbé).

  • Word Morphism -- Word Morphism actually herits from SageObject and it should be a more general Morphism class. (Sébastien Labbé).

  • Language -- Create a Language class. (Sébastien Labbé, Vincent Delecroix).

  • Discussion about the content-datastructure-as-subobject (anti?)design pattern
  • Fixed points of word morphisms -- Create of a new class derived from InfinteWord for fixed point of a WordMorphism. It's necessary to consider those words as very special infinite words because most of the 'infinite objects' associated (language, complexity, ...) can be computed. (Vincent Delecroix).

  • Geometrization of WordMorphism -- following the work of G. Rauzy, A. Siegel, P. Arnoux, ... (Vincent Delecroix)

  • Class for biinfinite words, and words indexed by anything (Z2, Zn, graphs, ...). (Vincent Delecroix)

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.

  • 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 (NicolasThiery)

  • 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)

Talks

If you would like to give a talk, for example, to demonstrate your code, then add your name and topic to the list. These talks should be not more than 20 minutes (since we want a lot of time to code).

  • Sage-Combinat Development -- how to install sage-combinat; how to update; how to contribute (hg, patch server, trac, ....). (NicolasThiery)

  • Cythonize python files -- The key points to do when translating a python file already in sage into cython. (Who wants to lead this?)

  • The new category framework -- Design and usage (NicolasThiery)

  • Root system plots -- Demo (NicolasBorie)

combinat/SageCombinatWorkshopOrsay (last edited 2011-01-10 11:39:30 by NicolasThiery)