Metraipolis › archive › dc_6428dbfc1091
Four hyperplanes do not always equipartition a mass in $\mathbb{R}^4$ — arXiv:2608.23312
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.23312
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:33:32.278Z
- SHA-256 of the archived text
a2eba3479fc15078f30e7a21273c823ecd83788600cff99d0234c31d6a36ea74- Stable URL of this page
https://metraipolis.com/documento/dc_6428dbfc1091
How to cite
Four hyperplanes do not always equipartition a mass in $\mathbb{R}^4$ — arXiv:2608.23312 — arXiv (en), https://arxiv.org/abs/2608.23312 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6428dbfc1091 (Metraipolis archive dc_6428dbfc1091, sha256 a2eba3479fc15078f30e7a21273c823ecd83788600cff99d0234c31d6a36ea74)
BibTeX
@misc{dc6428dbfc1091,
title = {Four hyperplanes do not always equipartition a mass in $mathbbR^4$ — arXiv:2608.23312},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.23312},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6428dbfc1091; sha256 a2eba3479fc15078f30e7a21273c823ecd83788600cff99d0234c31d6a36ea74},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.23312. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We construct a smooth strictly positive density in $\mathbb{R}^4$ that cannot be divided into $16$ parts of the same size by four affine hyperplanes. This settles the last open case of Grünbaum's 1960 conjecture and disproves Ramos' general conjecture on hyperplane equipartitions. We reduce the construction to finding two homogeneous polynomials in four variables, of degrees three and four, whose multilinear coefficients cannot vanish simultaneously after any orthogonal change of coordinates. We give two proofs of this nonvanishing result. The first uses a local perturbation argument. The second reduces it to the absence of a common zero for five explicit polynomials on $[-1,1]^6$, verified by a computer-assisted Bernstein subdivision argument.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.23312 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.456Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).