• D

F Nous contacter

0

# Documents  05A19 | enregistrements trouvés : 2

O

Sélection courante (0) : Tout sélectionner / Tout déselectionner

P Q

## Post-edited  Parking spaces and Catalan combinatorics for complex reflection groups Lanini, Martina (Auteur de la Conférence) | CIRM (Editeur )

Recently, Armstrong, Reiner and Rhoades associated with any (well generated) complex reflection group two parking spaces, and conjectured their isomorphism. This has to be seen as a generalisation of the bijection between non-crossing and non-nesting partitions, both counted by the Catalan numbers. In this talk, I will review the conjecture and discuss a new approach towards its proof, based on the geometry of the discriminant of a complex reflection group. This is an ongoing joint project with Iain Gordon. Recently, Armstrong, Reiner and Rhoades associated with any (well generated) complex reflection group two parking spaces, and conjectured their isomorphism. This has to be seen as a generalisation of the bijection between non-crossing and non-nesting partitions, both counted by the Catalan numbers. In this talk, I will review the conjecture and discuss a new approach towards its proof, based on the geometry of the discriminant of a complex ...

## Multi angle  Vertex degrees in planar maps Drmota, Michael (Auteur de la Conférence) | CIRM (Editeur )

We consider the family of rooted planar maps $M_\Omega$ where the vertex degrees belong to a (possibly infinite) set of positive integers $\Omega$. Using a classical bijection with mobiles and some refined analytic tools in order to deal with the systems of equations that arise, we recover a universal asymptotic behavior of planar maps. Furthermore we establish that the number of vertices of a given degree satisfies a multi (or even infinitely)-dimensional central limit theorem. We also discuss some possible extension to maps of higher genus.
This is joint work with Gwendal Collet and Lukas Klausner
We consider the family of rooted planar maps $M_\Omega$ where the vertex degrees belong to a (possibly infinite) set of positive integers $\Omega$. Using a classical bijection with mobiles and some refined analytic tools in order to deal with the systems of equations that arise, we recover a universal asymptotic behavior of planar maps. Furthermore we establish that the number of vertices of a given degree satisfies a multi (or even inf...

##### Codes MSC

Nuage de mots clefs ici

Z