Papers
Topics
Authors
Recent
2000 character limit reached

Hyperplane mass partitions via relative equivariant obstruction theory

Published 9 Sep 2015 in math.AT, math.CO, and math.MG | (1509.02959v2)

Abstract: The Gr\"unbaum-Hadwiger-Ramos hyperplane mass partition problem was introduced by Gr\"unbaum (1960) in a special case and in general form by Ramos (1996). It asks for the "admissible" triples $(d,j,k)$ such that for any $j$ masses in $\mathbb{R}d$ there are $k$ hyperplanes that cut each of the masses into $2k$ equal parts. Ramos' conjecture is that the Avis-Ramos necessary lower bound condition $dk\ge j(2k-1)$ is also sufficient. We develop a "join scheme" for this problem, such that non-existence of an $G_k$-equivariant map between spheres $(Sd){*k} \rightarrow S(W_k\oplus U_k{\oplus j})$ that extends a test map on the subspace of $(Sd){*k}$ where the hyperoctahedral group $G_k$ acts non-freely, implies that $(d,j,k)$ is admissible. For the sphere $(Sd){*k}$ we obtain a very efficient regular cell decomposition, whose cells get a combinatorial interpretation with respect to measures on a modified moment curve. This allows us to apply relative equivariant obstruction theory successfully, even in the case when the difference of dimensions of the spheres $(Sd){*k}$ and $S(W_k\oplus U_k{\oplus j})$ is greater than one. The evaluation of obstruction classes leads to counting problems for concatenated Gray codes. Thus we give a rigorous, unified treatment of the previously announced cases of the Gr\"unbaum-Hadwiger-Ramos problem, as well as a number of new cases for Ramos' conjecture.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.