arXiv (All)
open access
Tverberg's theorem for unions of convex sets: Sharp bounds and colored extensions
Let $f_{r}(d,s_{1},\ldots,s_{r})$ be the least $N$ such that every $N$-point set $P\subseteq\mathbb{R}^{d}$ has an $r$-partition $P=P_{1}\sqcup\cdots\sqcup P_{r}$ with the following property: whenever $C_{i}\supseteq P_{i}$ is a union of at most $s_{i}$ convex sets, one has $\bigcap_{i=1}^{r}C_{i}\n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New upper bounds for the chromatic numbers of Euclidean spaces#1034254
- Discrepancy theory, Tverberg's theorem, and regression depth#1051178
- Favard length of non-homogeneous random disc-like Cantor sets#1118269
- Overcolored Partition Restricted by Parity of the Parts#1117335
- Sudakov minoration for unconditional log-concave vectors with negatively associated magnitudes#1104724
Record · ID 973267
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive