Metraipolis › archive › dc_607c6be48417
A note on distinct volume subsets problem — arXiv:2608.22320
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22320
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:32:12.522Z
- SHA-256 of the archived text
f016a0e90bec334a61c255daba4c3e17655469903fd28cacf1bf908825e98aee- Stable URL of this page
https://metraipolis.com/documento/dc_607c6be48417
How to cite
A note on distinct volume subsets problem — arXiv:2608.22320 — arXiv (en), https://arxiv.org/abs/2608.22320 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_607c6be48417 (Metraipolis archive dc_607c6be48417, sha256 f016a0e90bec334a61c255daba4c3e17655469903fd28cacf1bf908825e98aee)
BibTeX
@misc{dc607c6be48417,
title = {A note on distinct volume subsets problem — arXiv:2608.22320},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22320},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_607c6be48417; sha256 f016a0e90bec334a61c255daba4c3e17655469903fd28cacf1bf908825e98aee},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22320. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For $2 \leq a \leq d+1$, what is the largest integer $H_{a,d} (n)$ such that every set of $n$ points in $\mathbb{R}^d$ with no $a$ points on a common $(a-2)$-flat contains a subset of $H_{a,d} (n)$ points whose determined $(a-1)$-dimensional simplices have pairwise distinct $(a-1)$-dimensional volumes? We construct $n$-point sets that improve the best known upper bounds for $H_{a,d}(n)$ in several cases of $a$ and $d$. We also study a dual version of the problem. Let $D_d(n)$ the maximum number such that for any arrangement of $n$ hyperplanes in general position in $\mathbb{R}^d$, we can always find a subset of $D_d(n)$ hyperplanes for which all the $d$-dimensional simplices that they define have distinct $d$-dimensional volumes. We improve the current known upper bound for $D_d(n)$ and give the first nontrivial lower bound for $D_2(n)$ and $D_3 (n)$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2608.22320 — 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.406Z 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).