The Generalized Makeev Problem Revisited

DOI10.1007/S13366-024-00737-YMaRDI QIDQ6509973arXivFDO

Authors Andres Mejia, Steven H. Simon, Jialin Zhang

Published in arXiv

Full work available at URL https://doi.org/10.1007/S13366-024-00737-Y

Abstract: Based on a result of Makeev, in 2012 Blagojevi'c and Karasev proposed the following problem: given any positive integers $m$ and $1leqellleqk$, find the minimum dimension $d=Delta(m;ell/k)$ such that for any $m$ mass distributions on $mathbb{R}^d$, there exist $k$ hyperplanes, any $ell$ of which equipartition each mass. The $ell=k$ case is a central question in geometric and topological combinatorics which remains open except for few values of $m$ and $k$. For $ell<k$ and arbitrary $m$, we establish new upper bounds on $Delta(m;ell/k)$ when (1) $ell=2$ and $k$ is arbitrary and (2) $ell=3$ and $k=4$. When $ell=k-1$ and $m+1$ is a power of two these bounds are nearly optimal and are exponentially smaller than the current best upper bounds when $ell=k$. Similar remarks apply to our upper bounds when the hyperplanes are prescribed to be pairwise orthogonal. Lastly, we provide transversal extensions of our results along the lines recently established by Frick et al.: given $m$ families of compact convex sets in $mathbb{R}^d$ such that no $2^{e}ll$ members of any family are pairwise disjoint, we show that every member of each family is pierced by the union of any $ell$ of some collection of $k$ hyperplanes.

This page was built for publication: The Generalized Makeev Problem Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509973)