The Generalized Makeev Problem Revisited
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914708425015296 |
|---|---|
| author | Mejia, Andres Simon, Steven Zhang, Jialin |
| author_facet | Mejia, Andres Simon, Steven Zhang, Jialin |
| contents | Based on a result of Makeev, in 2012 Blagojević and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=Δ(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 $Δ(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^\ell$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_03818 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The Generalized Makeev Problem Revisited Mejia, Andres Simon, Steven Zhang, Jialin Combinatorics Metric Geometry Based on a result of Makeev, in 2012 Blagojević and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=Δ(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 $Δ(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^\ell$ 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. |
| title | The Generalized Makeev Problem Revisited |
| topic | Combinatorics Metric Geometry |
| url | https://arxiv.org/abs/2305.03818 |