activity
20072023
most citedThe brick polytope of a sorting network

60 citations · 768 across the 56 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

math.CO2012★ 14 cited

Vertex barycenter of generalized associahedra

Vincent Pilaud, Christian Stump

We show that the vertex barycenter of generalized associahedra and permutahedra coincide for any finite Coxeter system.

math.CO2012

EL-labelings and canonical spanning trees for subword complexes

Vincent Pilaud, Christian Stump

We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide c…

cs.CG2012★ 10 cited

Enumerating topological -configurations

Jürgen Bokowski, Vincent Pilaud

An -configuration is a set of points and lines in the projective plane such that their point-line incidence graph is -regular. The configuration is geometric, top…

math.CO2012★ 1 cited

Obstructions to weak decomposability for simplicial polytopes

Nicolai Hähnle, Steven Klee, Vincent Pilaud

Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge…

math.CO2012

The greedy flip tree of a subword complex

Vincent Pilaud

We describe a canonical spanning tree of the ridge graph of a subword complex on a finite Coxeter group. It is based on properties of greedy facets in subword complexes, defined an…

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.…