activity
20032019
most citedOptimal topological simplification of discrete functions on surfaces

49 citations · 146 across the 11 of their papers we have counts for

collaborators
Showing math.COShow all

8 papers · 1 filter

math.CO2018

Cambrian acyclic domains: counting -singletons

Jean-Philippe Labbé, Carsten Lange

We study the size of certain acyclic domains that arise from geometric and combinatorial constructions. These acyclic domains consist of all permutations visited by commuting equiv…

math.CO2013★ 31 cited

Associahedra via spines

Carsten Lange, Vincent Pilaud

An associahedron is a polytope whose vertices correspond to triangulations of a convex polygon and whose edges correspond to flips between them. Using labeled polygons, C. Hohlweg…

math.CO2007★ 15 cited

Isometry classes of generalized associahedra

Nantel Bergeron, Christophe Hohlweg, Carsten Lange +1

Let be a finite Coxeter system acting by reflections on an -Euclidean space with simple roots $Δ=\{\a_s | s\in S\}$ of the same length and fundamental weights $Δ…

math.CO2007★ 3 cited

Permutahedra and generalized associahedra

Christophe Hohlweg, Carsten Lange, Hugh Thomas

Given a finite Coxeter system and a Coxeter element , we construct a simple polytope whose outer normal fan is N. Reading's Cambrian fan , settling a conjecture of…

math.CO2005★ 4 cited

Realizations of the associahedron and cyclohedron

Christophe Hohlweg, Carsten Lange

We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and comp…

math.CO2005★ 1 cited

On generalized Kneser hypergraph colorings

Carsten Lange, Guenter M. Ziegler

In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\KG{r}{\pmb s}{\calS}$, "generalized -uniform Kneser hypergraphs with inte…