Metraipolis › archive › dc_b2f6c242f645
Containment Problems in Convex Sets — arXiv:2611.08835
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08835
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:43:54.884Z
- SHA-256 of the archived text
b4a4fb342d5bcc98d4712e796a83d9855701561f0bdbadccd0c13cdc47edc1d0- Stable URL of this page
https://metraipolis.com/documento/dc_b2f6c242f645
How to cite
Containment Problems in Convex Sets — arXiv:2611.08835 — arXiv (en), https://arxiv.org/abs/2611.08835 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b2f6c242f645 (Metraipolis archive dc_b2f6c242f645, sha256 b4a4fb342d5bcc98d4712e796a83d9855701561f0bdbadccd0c13cdc47edc1d0)
BibTeX
@misc{dcb2f6c242f645,
title = {Containment Problems in Convex Sets — arXiv:2611.08835},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08835},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b2f6c242f645; sha256 b4a4fb342d5bcc98d4712e796a83d9855701561f0bdbadccd0c13cdc47edc1d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08835. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $P$ be a set of $n$ points in the plane, and let $C$ be a compact, convex subset of the plane that contains the origin in its interior. We study the problem of finding two points $p$ and $q$ of $P$ with the property that any homothet of $C$ that contains $p$ and $q$ must contain at least a constant fraction of the points of $P$. We give proofs for several cases. When $C$ is strictly convex we achieve a fraction of $1/5$, and when $C$ is a general convex region we achieve a fraction of $1/6e$. We show how the ideas of this second bound can be used to prove a lower bound for a version of the problem in $\mathbb{R}^d$ when $C$ is a $d$-ball. We also consider a few special cases. When $C$ is a triangle we get a lower bound of $1/12$, and when we allow that triangle to be rotated by $\pi$ radians in addition to being scaled and translated we get a lower bound of $1/768$. In proving this last result, we improve the state of the art on the version of this problem in three dimensions, where $C$ is a parallelepiped. We also consider the algorithmic aspects of finding such a pair of points.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Computational Geometry (cs.CG) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.08835 — 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-11-09T22:36:32.161Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).