Since October 2010, I am a CNRS research scientist in IRIF (ex LIAFA).
My main areas of research are enumerative combinatorics, random discrete structures, and algebraic combinatorics.
I am particularly
interested in the properties of maps (which are graphs embedded on
surfaces), and related combinatorial or algebraic objects (such as trees, graphs, Tamari intervals, or reflection groups).
A previous manuscript, entitled Tamari lattices and parking functions: proof of a conjecture of F. Bergeron and never submitted (since it was soon superseded by this one) is available there:
(previous-manuscript-arxiv).
It contains only the results on the dimension/enumeration, not the full representation, and it may be a more accessible, less technical, introduction to our method.
Combinatorics, Probability, and Computing 18(04):477-516 (2009), 40 pages
(pdf file)
a related, less general, conference paper Are even maps on surfaces likely to be bipartite?
appeared in the proceedings of
MathInfo'08. It presents the results in the even degree case.
(short version)