Journée-séminaire de combinatoire

(équipe CALIN du LIPN, université Paris-Nord, Villetaneuse)

Le 20 février 2018 à 10h30 en B107, Sergey Dovgal nous parlera de : Pólya enumeration theorem from scratch I

Résumé : I am going to talk about very popular combinatorial connection between ordinary and exponential generating functions which is called cycle index function. I am going to define the combinatorial species according to the book "Theory of Species" by Bergeron, Labelle, Leroux, and present their beautiful proof of the cycle index composition theorem. The proof relies on the theory of symmetric functions in infinitely many variables. This proof is a beautiful example of Grothendieck's concept: in order to prove something particular, one should make a more general statement and prove it.

Dernière modification : Monday 12 February 2018 Valid HTML 4.01! Valid CSS! Contact : Cyril.Banderier at