or
or
By clicking below, you agree to our terms of service.
Sign in with Wallet
New to HackMD? Sign up
| Syntax | Example | Reference | |
|---|---|---|---|
| # Header | Header | 基本排版 | |
| - Unordered List |
|
||
| 1. Ordered List |
|
||
| - [ ] Todo List |
|
||
| > Blockquote | Blockquote |
||
| **Bold font** | Bold font | ||
| *Italics font* | Italics font | ||
| ~~Strikethrough~~ | |||
| 19^th^ | 19th | ||
| H~2~O | H2O | ||
| ++Inserted text++ | Inserted text | ||
| ==Marked text== | Marked text | ||
| [link text](https:// "title") | Link | ||
|  | Image | ||
| `Code` | Code |
在筆記中貼入程式碼 | |
| ```javascript var i = 0; ``` |
|
||
| :smile: |  |
Emoji list | |
| {%youtube youtube_id %} | Externals | ||
| $L^aT_eX$ | LaTeX | ||
| :::info This is a alert area. ::: |
This is a alert area. |
On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?
Please give us some advice and help us improve HackMD.
Do you want to remove this version name and description?
Syncing
xxxxxxxxxx-
Any changes
Be notified of any changes
-
Mention me
Be notified of mention me
-
Unsubscribe
SubscribeSchedule for Free and Practical Software for Algebraic Combinatorics 2019
We have made the schedule voluntarily flexible to maximize opportunities for participants to learn and collaborate.
The main purpose of the plenary talks is to pave the path for the implementation of new features in Sage and related software. They are here to ignite, inspire and fuel brainstorms and coding sprints with other participants. In addition there will be short demos to give an overview of the ecosystem to all participants. And then a combination of free tutorials where we point participants to resources to explore according to their pace and taste, with support from instructors roaming around. And possibly guided tutorials or longer presentations in separate rooms. The schedule will be progressively refined according to the participants' interest. Participants are encouraged to skip the parts that are irrelevant to them (e.g. tutorials on material they already master) to engage into parallel collaborative activities such as coding sprints.
Venue
The main conference room will be 205 (112 seats). We will also have three breakout rooms: 202 (60 seats), 203, 204 (45 seats). Each is equipped with a white screen and white board, video projector with VGA cable (note: Prenosnik = laptop), a computer, some power outlets, one ethernet cable with DHCP. We will install a couple power strips in each room, and many of them in 205.
At the Youth Hostel, we will have a 20 seat room available in the evening for more coding sprints (the math department closes at night).
Monday 8: Getting started
Tomer Bauer
Odile Bénassy
Tuesday 9: Programming in Python, Sage, GAP,…
Wencin Poh
(recommended before the git tuto)
Pauline Hubert, Nadia Lafrenière
Wednesday 10: Sharing experiments and code
Thursday 11: Contributing back, Education
Friday 12
Titles and abstracts
Anne Schilling
Impact of computer-assisted experimentation in combinatorics
This talk will give background on why computer experiments are useful and give an example of a new implementation idea.
Se-jin Oh
Number triangles observed as weight multiplicities via simple sage codes
In this talk, I will start with very simple code which tells me some weight multiplicities of highest weight modules over quantum affine algebras. Among them we can observe families of numbers which form number triangles such as the Catalan, Motzkin, Riordan and Bessel triangles. We show that these numbers appear as weight multiplicities of maximal dominant weight modules over quantum groups by introducing and enumerating new families of Young tableaux. This is joint work with Jangsoo Kim and Kyu-Hwan Lee (arXiv:1703.10321).
Jae-Hoon Kwon
Spinor model for classical crystals and applications
A spinor model is a combinatorial model for the crystal graphs of finite dimensional irreducible modules over classical Lie algebras of types B, C, D. In this talk, we will give some applications of this model including branching rules and Littlewood-Richardson coefficients (arXiv:1512.01877).
Kyu-Hwan Lee
Fully commutative elements of complex reflection groups
In this talk we extend the usual notion of fully commutative elemments of finite Coxter groups to complex reflection groups. We decompose the sets of fully commutative elements into natural subsets according to their combinatorial properties, and investigate the structure of these decompositions. As a consequence, we enumerate and describe the form of these elements for complex reflection groups. The results have a close connection with the problem of computing Groebner-Shirsov bases; and examples of computer computations of Groebner-Shirsov bases will be presented. This is joint work with Gabriel Feinberg, Sungsoon Kim and Se-jin Oh (arXiv:1808.04269).