Convex equipartitions via Equivariant Obstruction Theory

By Pavle V. M. Blagojević, Günter M. Ziegler. 2012

78 citations recorded by the source corpus.

We describe a regular cell complex model for the configuration space F(ℝd, n). Based on this, we use Equivariant Obstruction Theory to prove the prime power case of the conjecture by Nandakumar and Ramana Rao that every polygon can be partitioned into n convex parts of equal area and perimeter.

Subfields: Applied Mathematics, Discrete Mathematics and Combinatorics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/6a13588e6a83a2a3ba87687af0bbc30949cff3de

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

1. Boris Aronov
2. Fernando Muro
3. Alfredo Hubard
4. Roman N. Karasev

In Discrete Mathematics and Combinatorics

1. Boris Aronov
2. Fernando Muro
3. Alfredo Hubard
4. Roman N. Karasev

In Mathematical Physics

1. Boris Aronov
2. Fernando Muro
3. Alfredo Hubard
4. Roman N. Karasev
5. Pavle V. M. Blagojević
6. Günter M. Ziegler

Citations in the corpus

• Convex equipartitions: the spicy chicken theorem (2013, methodology): “wisted coecients). CONVEX EQUIPARTITIONS: THE SPICY CHICKEN THEOREM 9 Figure 1. Trees and cells: three trees and matching example point congurations from the corresponding cells In the recent paper [6], Theorem 1.10 was established without using compact support homology nor twisted coecients by cons”
• Dwyer–Kan homotopy theory of enriched categories (2012, methodology): “3 and [12] we study the Lusternik– Schnirelmann category of unordered configuration spaces F (R, n)/Sn as well as sectional category of the covering F (R, n)→ F (R, n)/Sn.”