Hi, thanks Thomas for setting up this mailing-list and the wiki (beware, the next step is the "liste de la mort" which is a point of no-return). I am in charge of a transverse (or disjoint? you will decide) course about Sage (http://sagemath.org). After some introductory material, it could be nice to let the participants work on some topics related to the lectures. So, if there is something that may have something to do with algorithmics (simulations, conjecture checking, proofs, ...), please add it to the wiki, even if you do not know how such things work, we can work together on appropriate exercises. Also, if you know some existing related libraries that could be useful, we can also try to interface them with Sage before the beginning of the school so that we can use them there. Shall we use a separate page for that or it is OK to dump discussions there ? Le 2014-12-10 14:11, Thomas Fernique a écrit :
let us first indicate the content of lectures, then I will provide a dependancies graph of the lectures so that the propositions of swapping lecture can be taken into account
Do you plan to swap according to the Huber bounding Markov chain to sample an impartial linear extension of the dependency poset ? :P Ciao, Thierry