23 citations · 199 across the 45 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.AT2019
Parametrized Complexity of Expansion Height
Ulrich Bauer, Abhishek Rathod, Jonathan Spreer
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of th…
math.MG2019
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…