Introduction to species and combinatorial equations

Duration: 1 hour 17 mins 58 secs
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Labelle, G, for Leroux, P (UQAM)
Monday 07 April 2008, 10:00-11:11
Combinatorial Identities and their Applications in Statistical Mechanics
 
Created: 2008-04-20 16:01
Collection: Combinatorics and Statistical Mechanics
Publisher: Isaac Newton Institute
Copyright: Labelle, G
Language: eng (English)
Credits:
Author:  Labelle, G
Producer:  Steve Greenham
 
Abstract: 1) Elementary introduction to species through examples : Collecting structures into species leading to the general definition of a combinatorial species. Exponential generating series of a species for labelled enumeration. Elementary combinatorial operations and equations between species.

2) More advanced theory : Cycle index and tilda series of a species for unlabelled enumeration. Equipotence versus combinatorial equality. Taking connected components. Combinatorial equations for weighted connected and 2-connected graphs. Explicit examples.

*Note : This lecture is preparatory to the reading of papers of Pierre Leroux and collaborators. These papers are available below. Other material, including a link to the book "Combinatorial Species and Tree-like Structures", can be found on Pierre Leroux's web page

Introduction to the Theory of Species of Structures, by François Bergeron, Gilbert Labelle, and Pierre Leroux.

Papers and slides on Mayer graph weights:

* Enumerative problems inspired by Mayer's theory of cluster integrals, by Pierre Leroux.
* Graph weights arising from Mayer's theory of cluster integrals, slides by Pierre Leroux.
* Graph weights arising from Mayer's theory of cluster integrals, by G. Labelle, P. Leroux and M. G. Ducharme.
* Note on Legendre transform and line-irreducible graphs, by David Brydges and Pierre Leroux.

Papers and slides on two-connected graphs:

* 2-connected graphs with prescribed three-connected components, slides by Pierre Leroux.
* 2-connected graphs with prescribed 3-connected components, slides by Pierre Leroux.
* Two-connected graphs with prescribed three-connected components, by Andrei Gagarin, Gilbert Labelle, Pierre Leroux and Timothy Walsh.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 1.05 GB View Download
WebM 480x360    615.27 kbits/sec 346.99 MB View Download
Flash Video 480x360    806.8 kbits/sec 461.31 MB View Download
iPod Video 480x360    505.26 kbits/sec 288.90 MB View Download
QuickTime 384x288    848.6 kbits/sec 485.22 MB View Download
MP3 44100 Hz 125.0 kbits/sec 71.26 MB Listen Download
Windows Media Video 478.78 kbits/sec 273.76 MB View Download
Auto * (Allows browser to choose a format it supports)