Differences between revisions 45 and 46
Revision 45 as of 2009-07-20 16:52:22
Size: 8412
Comment:
Revision 46 as of 2009-07-20 16:57:49
Size: 8451
Comment:
Deletions are marked like this. Additions are marked like this.
Line 37: Line 37:
|| 10:30-10:45 || Coffee Break || ||
||<|2> 10:45-11:45 ||<|2> Florent&nbsp;Hivert and Nicolas&nbsp;Thiéry || Introduction to Sage-combinat||
||<|1>10:30-10:45 || Coffee&nbsp;Break || ||
||<|2>10:45-11:45 ||<|2> Florent&nbsp;Hivert and Nicolas&nbsp;Thiéry || Introduction to Sage-combinat||
Line 40: Line 40:
|| 11:45-13:30 || Lunch&nbsp;Break || ||
||<|2> 13:30-15:00 ||<|2> Franco&nbsp;Saliola and Nicolas&nbsp;Thiéry || Hands on Tutorials||
||<|1>11:45-13:30 || Lunch&nbsp;Break || ||
||<|2>13:30-15:00 ||<|2> Franco&nbsp;Saliola and Nicolas&nbsp;Thiéry || Hands on Tutorials||
Line 43: Line 43:
||15:00-15.30|| Coffee&nbsp;Break || ||
||15:30-16:00|| Jason&nbsp;Bandlow || Symmetric Functions||
||<|1>15:00-15.30|| Coffee&nbsp;Break || ||
||<|1>15:30-16:00|| Jason&nbsp;Bandlow || Symmetric Functions||
Line 47: Line 47:
|| 17:15- || Coding Sprint Organization || Short self introductions, [[/projects|list of project ideas]] and people willing to work on them || ||<|1>17:15- || Coding Sprint Organization || Short self introductions, [[/projects|list of project ideas]] and people willing to work on them ||
Line 52: Line 52:
|| 12:00- || Free afternoon || || ||<|1>12:00- || Free afternoon || ||
Line 55: Line 55:
|| 9:30-10:00  ||Franco&nbsp;Saliola|| Posets ||
||<|2> 10:00-11:00 ||<|2> Carsten&nbsp;Schneider|| Symbolic Summation ||
||<|1>9:30-10:00||<|1>FrancoSaliola|| Posets ||
||<|2>10:00-11:00||<|2>Carsten&nbsp;Schneider|| Symbolic Summation ||
Line 58: Line 58:
||<|2> 11:00-12:00 ||<|2> Burcin&nbsp;Erocal|| Difference Fields and Symbolic Summation in Sage || ||<|2>11:00-12:00||<|2>Burcin&nbsp;Erocal|| Difference Fields and Symbolic Summation in Sage ||
Line 60: Line 60:
|| 12:00-13:30 || Lunch&nbsp;Break || ||
||<|2> 13:30-14:30 ||<|2> Franco&nbsp;Saliola || Python tutorial 1||
|| Elements of the language for combinatorics ||
||<|2> 14:30-15:30 ||<|2> Dan&nbsp;Drake || Combinatorial generation by backtracking ||
||<|1>12:00-13:30 || Lunch&nbsp;Break || ||
||<|2>13:30-14:30 ||<|2>FrancoSaliola|| Python tutorial 1||
||Elements of the language for combinatorics||
||<|2>14:30-15:30||<|2>DanDrake || Combinatorial generation by backtracking ||
||?summary?||
||15:30-16:00||Tea&nbsp;Time|| ||
||<|2>16:00-17:00||<|2>Franco&nbsp;Saliola|| Words ||
Line 65: Line 68:
|| 15:30-16:00 || Tea&nbsp;Time || ||
||<|2> 16:00-17:00 ||<|2> Franco&nbsp;Saliola || Words ||
|| ?summary? ||
|| 17:00- || Coding Sprint Status&nbsp;Reports || ||
||<|1>17:00-||Coding Sprint Status&nbsp;Reports|| ||
Line 71: Line 71:
|| 9:30-10:30 || Anne&nbsp;Schilling and Nicolas M. Thiéry|| Root systems, coxeter groups and crystals || ||<|1>9:30-10:30 || Anne&nbsp;Schilling and Nicolas M. Thiéry|| Root systems, coxeter groups and crystals ||
Line 74: Line 74:
|| 11:30-12:00 || Florent&nbsp;Hivert|| Version control with mercurial for LaTeX and programming ||
|| 12:00-13:30 || Lunch&nbsp;Break || ||
||<|1> 11:30-12:00 || Florent&nbsp;Hivert|| Version control with mercurial for LaTeX and programming ||
||<|1> 12:00-13:30 || Lunch&nbsp;Break || ||
Line 80: Line 80:
|| 16:00-16:30 || Tea&nbsp;Time || ||
|| 16:30-17:00 || Florent&nbsp;Hivert Nicolas&nbsp;Nicolas M. Thiéry || Implementing Hopf algebras ||
|| 17:00- || Coding Sprint Status&nbsp;Reports || ||
|| <|1>16:00-16:30 || Tea&nbsp;Time || ||
||<|1> 16:30-17:00 || Florent&nbsp;Hivert Nicolas&nbsp;Nicolas M. Thiéry || Implementing Hopf algebras ||
||<|1> 17:00- || Coding Sprint Status&nbsp;Reports || ||
Line 85: Line 85:
|| 9:30-10:30 || <speaker?> || Sharing experimental code with the Sage-Combinat patch server||
|| 10:30-12:00 || Coding sprints || ||
|| 12:00-13:30 || Lunch&nbsp;Break || ||
|| 13:30- || Coding sprints || ||
||<|1> 9:30-10:30 || <speaker?> || Sharing experimental code with the Sage-Combinat patch server||
||<|1> 10:30-12:00 || Coding sprints || ||
||<|1> 12:00-13:30 || Lunch&nbsp;Break || ||
||<|1> 13:30- || Coding sprints || ||
Line 91: Line 91:
|| 9:30-12:00 || Coding sprints || ||
|| 12:00-13:30 || Lunch&nbsp;Break || ||
|| 13:30- || Coding sprints || ||
|| 14:00- || Coding Sprint wrapup || ||
||<|1> 9:30-12:00 || Coding sprints || ||
||<|1> 12:00-13:30 || Lunch&nbsp;Break || ||
||<|1> 13:30- || Coding sprints || ||
||<|1> 14:00- || Coding Sprint wrapup || ||

*-Combinat 2009

International Sage Workshop on Free and Practical Software for Algebraic Combinatorics

Dates: July 25-29

Location: RISC, Linz, Austria

This event will follow FPSAC'09, and be part of RISC's summer 2009.

Goals

  • get new users and developers on board, especially from the FPSAC community
  • help former MuPAD-Combinat users to switch to Sage
  • developers meeting

Tentative program

  • Saturday:
    • Sage and Sage-Combinat introductory talks
    • Hands on tutorials
  • Sunday:
    • Informal Sage-Combinat lab: come work on your own problem with experts at your full disposition
    • Relaxed afternoon (to recover from a long FPSAC week)
  • Monday-Wednesday:
    • Informal Sage-Combinat lab
    • Technical talks
    • Short focused tutorials (see below)
    • Coding sprints
    • Design discussions

Saturday, July 25

9:30-10:30

Burcin Erocal and FrancoSaliola

Introduction to Sage

an overview talk about Sage, which explains the history and motivation for the project, demonstrates some key features of Sage, and discusses where we are going next. It will be accessible to people in all research areas and assumes no prior experience with Sage.

10:30-10:45

Coffee Break

10:45-11:45

Florent Hivert and Nicolas Thiéry

Introduction to Sage-combinat

an overview talk about Sage-combinat

11:45-13:30

Lunch Break

13:30-15:00

Franco Saliola and Nicolas Thiéry

Hands on Tutorials

?summary?

15:00-15.30

Coffee Break

15:30-16:00

Jason Bandlow

Symmetric Functions

16:00-17:00

Burcin Erocal

How to get started developing Sage

a summary of relevant bits and pieces for developing software with Sage

17:15-

Coding Sprint Organization

Short self introductions, list of project ideas and people willing to work on them

Sunday, July 26

9:30-12:00

Informal Sage-Combinat lab

come work on your own problem with experts at your full disposition

?list of possible topics?

12:00-

Free afternoon

Monday, July 26

9:30-10:00

FrancoSaliola

Posets

10:00-11:00

Carsten Schneider

Symbolic Summation

?summary?

11:00-12:00

Burcin Erocal

Difference Fields and Symbolic Summation in Sage

?summary?

12:00-13:30

Lunch Break

13:30-14:30

FrancoSaliola

Python tutorial 1

Elements of the language for combinatorics

14:30-15:30

DanDrake

Combinatorial generation by backtracking

?summary?

15:30-16:00

Tea Time

16:00-17:00

Franco Saliola

Words

?summary?

17:00-

Coding Sprint Status Reports

Tuesday, July 27

9:30-10:30

Anne Schilling and Nicolas M. Thiéry

Root systems, coxeter groups and crystals

10:30-11:30

Franco Saliola

Python tutorial 2

Data structures, dictionaries, hashing, mutability

11:30-12:00

Florent Hivert

Version control with mercurial for LaTeX and programming

12:00-13:30

Lunch Break

13:30-14:30

Ralf Hemmecke and Florent Hivert

Combinatorial species and tree-like structures

Practical use in Aldor and Sage

14:30-16:00

Nicolas Thiéry

Categories for the working mathematical programmer

Implementing algebraic structures in Sage, using parent, elements, and categories

<|1>16:00-16:30

Tea Time

16:30-17:00

Florent Hivert Nicolas Nicolas M. Thiéry

Implementing Hopf algebras

17:00-

Coding Sprint Status Reports

Wednesday, July 28

9:30-10:30

<speaker?>

Sharing experimental code with the Sage-Combinat patch server

10:30-12:00

Coding sprints

12:00-13:30

Lunch Break

13:30-

Coding sprints

Wednesday, July 28

9:30-12:00

Coding sprints

12:00-13:30

Lunch Break

13:30-

Coding sprints

14:00-

Coding Sprint wrapup

Projects

Organizers

Registration

Registration is free, but please register on: http://www.conferences.jku.at/riscsummer2009/e2570/index_eng.html.

Very convenient and reasonably priced rooms are available for reservation from the same site, but may run out. Register early!

Prerequisites

All attendees are expected to have Sage >= 4.1 and the Sage-Combinat patches installed on their laptops. If you do not plan to bring a laptop, please contact the organizers, and we will have a terminal setup for you. Please come see us for help during FPSAC if you encounter any problem!

Sage 4.1 will be available shortly from: http://www.sagemath.org/download.html

See http://wiki.sagemath.org/combinat/MercurialStepByStep for the installation instructions of Sage-Combinat. On UNIX/Mac, it boils down to running the following command in a terminal:

sage -combinat install

T-Shirts

If you would like to get the T-Shirt for this workshop (~$10), please write the size below before July 11th. Here is the current design (suggestions welcome): front-nt.png back-nt-2.png

And if you wonder about the meaning: Sage is the powerful propeller allowing us to soar high to our Castle in the Sky. Our hope is that in return our scouting will help drive the car to new horizons.

Registered Participants

  • Jason Bandlow
  • NicolasBorie (T-Shirt size L)

  • Adrien Boussicault
  • Mahir Bilen Can
  • Hayat Cheballah
  • Anders Claesson
  • DanDrake (T-shirt size M)

  • Burcin Erocal (T-Shirt sizes M + S)
  • Valentin Féray
  • Christoph Fuerst
  • Ralf Hemmecke
  • FlorentHivert

  • Alain Lascoux
  • Conrado Martinez
  • Peter McNamara (leaving Monday afternoon)

  • Philippe Nadeau
  • Yasuhide NUMATA
  • Steven Pon
  • FrancoSaliola (leaving 28 July)

  • Anne Schilling (T-Shirt size S)
  • Flavia Stan
  • Jessica Striker
  • Hossein Teimoori
  • NicolasThiéry (T-Shirt size M)

  • Haseeb Ul Haq
  • Zafeirakis Zafeirakopoulos

Unconfirmed participants

Preliminary list of short tutorials

Besides the main general-purpose Sage-Combinat tutorial, we will run short tutorials focused on specific features, with a (flexible) format like 10 minutes of presentation; 20 minutes of exercises. Here are some ideas. Please feel free to suggest others, especially around some features you developed yourself!

  • Posets (Franco?)
  • Words (Franco?)
  • Species and decomposable classes in Axiom / Aldor / Maple / MuPAD (Mike? Ralf? Martin?)
  • guess in Axiom / Aldor (Martin?)
  • Coxeter groups, crystals (Anne, Nicolas)
  • Symmetric Functions, Non Commutative Symmetric Functions, using algebras with several basis (Jason? Nicolas?)
  • categories/parents/elements (Nicolas)
  • Implementing enriched enumerated sets, (e.g. how to enrich the partitions of 5 with a semi-groups structure) (Florent?)
  • Implementing new combinatorial objects (?)
  • Implementing new (Hopf) Algebras with bases (Florent? Nicolas?)
  • Sharing code with the Sage-combinat patch server
  • using the GenericBacktracker class to generate lattice paths and other objects (Dan Drake)?

combinat/FPSAC09 (last edited 2013-03-05 20:20:14 by burcin)