Search arXivSearch

arXiv · 2404.14320

Bisecting masses with families of parallel hyperplanes

Abstract

We prove a common generalization of several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham sandwich theorem, the necklace splitting theorem for two thieves, a theorem about chessboard splittings using hyperplanes with fixed directions, and all known cases of Langerman's conjecture about bisections with $n$ hyperplanes. Our main result also confirms an infinite number of previously unknown cases of the following conjecture of Takahashi and Soberón: \emph{For any $d+k-1$ measures in $\mathbb{R}^d$, there exist an arrangement of $k$ parallel hyperplanes that bisects each of the measures.} The general result follows from the case of measures that are supported on a finite set with an odd number of points. The proof for this case is inspired by ideas of differential and algebraic topology, but it is a completely elementary parity argument. Additionally, we disprove a conjecture by Langerman on bisections of measures using hyperplane arrangements, showing that the conditions in our main result are sometimes necessary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alfredo Hubard, Pablo Soberón. 2026-06-15. Bisecting masses with families of parallel hyperplanes. https://arxiv.org/abs/2404.14320

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO