activity
20072026
most citedA simple model of trees for unicellular maps

52 citations · 402 across the 46 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

math.CO2012★ 27 cited

Counting factorizations of Coxeter elements into products of reflections

Guillaume Chapuy, Christian Stump

In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the expo…

math.CO2012★ 2 cited

The vertical profile of embedded trees

Mireille Bousquet-Mélou, Guillaume Chapuy

Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prov…

math.CO2012★ 9 cited

A note on a Cayley graph of S_n

Guillaume Chapuy, Valentin Féray

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several co…

math.CO2012★ 36 cited

The representation of the symmetric group on m-Tamari intervals

Mireille Bousquet-Mélou, Guillaume Chapuy, Louis-François Préville-Ratelle

An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my}. The set…

math.CO2012★ 52 cited

A simple model of trees for unicellular maps

Guillaume Chapuy, Valentin Féray, Eric Fusy

We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining t…

math.CO2012

A note on the diameter of transportation polytopes with prescribed source degrees

Henning Bruhn-Fujimoto, Guillaume Chapuy, Edward D. Kim +1

Brightwell, van den Heuvel and Stougie proved that the diameter of an transportation polytope is at most , a factor of eight away from the Hirsch Conjecture.…