Gilles Schaeffer: slides

[Home page] [Page maison]

17/12/2004. This page is under construction and still has many faulty links. Stay tuned.

This page will contains slides of some talks I gave.
I plan to provide separately: an integrated list, a bibtex file, a commented thematic bibliography, a selection of slides, a publication list, web pages of my coauthors.

• some relatively general CS-oriented presentation, from a talk given in Caen for the NormaSTIC research federation (pdf).

• Slides of a talk at a session in honor of J.G. Penaud at the 2022 GASCom Conference in Varese (pdf).
  These slide present the application to random sampling of the generic algebraic decomposition of combinatorial structure admitting a first order decomposition with one catalytic variable.
• Slides of an invited talk at a conference for the anniversary of Cori-Vauquelin's bijection in Bordeaux, 2021 (pdf).
  These slide present a generic algebraic decomposition of combinatorial structures that admit a first order decomposition with one catalytic variable and an application to Dyck-Lukasievicz trees.
• ...
• Slides of an invited talk at FPSAC'18 in Hanover (USA) (pdf). Slides of a more probabilistic oriented talk on the same topic in Cambridge (pdf).
  These talks present a bijective proof of Hurwitz formula based on mobiles.
• Slides of a contributed talk at FPSAC'17 in London (pdf).
  This talk present a joint work with Enrica Duchi, Veronica Guerrini and Simone Rinaldi on the enumeration of Fighting Fish.
• Slides of an invited talk at a conference in honor of M.P. Schützenberger in Bordeaux, 2016 (pdf).
  This talk present a joint work with Clément Dervieux and Dominique Poulalhon on the enumeration of corner cut polyhedra.
• Slides of invited talks at the AofA 2014 conference (pdf)
  This talk gives an overview and comparison of bijections between labelled trees and maps, both in the Catalan and Cayley realms.
• Slides of invited talks at the séminaire de probabilité du LPMA in january 2014 (pdf), and at the journée Cartes at LIPN in november 2013 (pdf).
  These talks present a joint work with Razvan Gurau on regular colored graphs.
• Slides of an invited talk at the Math department Colloquium of the LAREMA in june 2013 (pdf).
  This is a introductory talk to ramified cover enumeration and the combinatorial approach to map enumeration via trees.
• Slides of an invited talk at the workshop Quantum gravity in Paris-Orsay in mars 2013 (pdf).
  This is a talk for a mixed math/physics audience on the links between trees and maps, focusing on the case of triangulations.
• Slides of an invited talk at the Colloquium de l'institut Camille Jordan in Lyon in mai 2012 (french) (pdf).
  This is a general purpose talk on bijective map enumeration and applications to the study of large random maps.
• Slides of 3 invited lectures at the séminaire lotharingien de combinatoire in march 2012 (pdf).
  This is an introduction to bijective combinatorics of trees, maps and ramified coverings.
• Slides of an invited talk at the Journées de Combinatoire de Bordeaux in february 2012 (french) (pdf).
  This talk presents Hurwitz formula and its bijective proof.
• Slides of an invited talk at the séminaire parisien de combinatoire énumérative et analytique in december 2010 (french) (pdf).
  This is an introduction to combinatorics of trees and maps, with a glipse of recent developement by Bernardi, Chapuy and Fusy.
• Slides of an invited talk at the conference Analysis of Algorithms in Frejus in june 2009 (pdf).
  This is an introduction to combinatorial entropy and succinct data structures
  Same talk was also given at SIESTE in ENS Lyon in february 2010
• Slides of a talk in honor of Robert Cori in Paris in june 2009 (pdf).
  A talk about Cori-Vauquelin's bijection on maps
• Slides of a talk in honor of Philippe Flajolet in Paris in december 2008 (pdf).
  This is a short talk about random sampling
• Slides of a talk in front of the Academie of Science in Paris in october 2007 (pdf).
  This is a very short talk about maps and trees.
• Slides for the receipt of the european price in combinatorics in the Real Alcazar of Sevilla in september 2007 (pdf).
  This is a short talk with some nice conjectures about graphs with minimal genus g at the end.
• Slides of an invited talk at the Enrage network workshop in Edinburgh in april 2006 (ps,pdf).
  This is an updated version, intended for an mathematical physics audience, of the Barcelona talk below.
• Slides of an invited talk at the JGA (journees de geometrie algorithmique) in Le Bessat in january 2006 (pdf).
  These slides, in french, give
  • an introduction to Schnyder trees, canonical orders and Schnyder's graph drawing algorithm,
  • an introduction to entropy optimal encoding of combinatorial structures and a short description of the Poulalhon-Schaeffer algorithms for the optimal encoding of planar triangulations.
• Slides of an invited talk at the EMS/CMS joint mathematical week-end in Barcelona in september 2005 (ps,pdf).
  These slides give
  • random maps as a model of random discrete surfaces
  • the labeled tree approach to the study of distances in random maps (joint work with Philippe Chassaing)
  • the extension to higher genus surfaces (joint work with Michel Marcus).
• Slides of an invited talk at the 54th seminaire lotharingien de combinatoire, in honor of the 60th birthday of Xavier Viennot in march 2005 (pdf).
  These slides present various interpretations of the super-Catalan numbers of order 2.
• Slides of an invited lecture in the european graduate program on Combinatorics, Geometry and Computation, in Berlin in may 2004 (pdf).
  These slides present the bijection between unrooted binary trees and quadrangulations of a hexagon and its application to 3-connected planar graphs sampling and mesh encoding.
• Slides of two invited lectures at the joint Rencontres mathematiques and Séminaire Hypathie at the ENS Lyon in 2002 (1st part: ps, pdf, 2nd part: ps, pdf).
  These slides form a nice introduction to my work on maps.
  • The first part survey map enumeration and random map properties and offers a bijective proof of Tutte's formula.
  • The second part present the proof of the diameter conjecture.
• Slides of an invited talk at the 7th seminar on Analysis of Algorithms in 2001 (ps, pdf).
  These slides present
  • the diameter conjecture, which was since proved by myself and Philippe Chassaing,
  • the asymptotic enumeration of prime alternating links.