49 citations · 146 across the 11 of their papers we have counts for
12 papers
Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes
Joseph Doolittle, Jean-Philippe Labbé, Carsten E. M. C. Lange +3
For -dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hype…
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…
Frustration index and Cheeger inequalities for discrete and continuous magnetic Laplacians
Carsten Lange, Shiping Liu, Norbert Peyerimhoff +1
We discuss a Cheeger constant as a mixture of the frustration index and the expansion rate, and prove the related Cheeger inequalities and higher order Cheeger inequalities for gra…
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…
Minkowski Decomposition of Associahedra and Related Combinatorics
Carsten Lange
Realisations of associahedra with linearly non-isomorphic normal fans can be obtained by alteration of the right-hand sides of the facet-defining inequalities from a classical perm…
Optimal topological simplification of discrete functions on surfaces
Ulrich Bauer, Carsten Lange, Max Wardetzky
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance δ from a given input function. The result is achieved…