Search arXivSearch

arXiv · 2608.06437

On colorful Helly numbers and the growth of Tverberg numbers

Abstract

In this paper, we obtain new upper and lower bounds on the colorful Helly number and the Tverberg number in an abstract convexity space with Radon number $r$. We prove an upper bound of $(r-1)2^r$ on the colorful Helly number, which is a factor $O(r)$ far from the lower bound, $2^{r-1}-1$. The best previous bound, by Holmsen and Lee (2021), was $r^{r^{\log r}}$. As a consequence, we obtain improved quantitative bounds for fractional Helly numbers, the selection lemma, weak $\varepsilon$-nets, and the $(p,q)$-theorem, in abstract convexity spaces. Furthermore, using the improved colorful Helly bound, we prove that the Tverberg number $r_k$ is at most $O(r^{\lceil \log_2 r \rceil})k$. The best previous bound, by Pálvölgyi (2022), was $r^{r^{r^{\log r}}}k$. We also study the $t$-wise Tverberg number $r_{k,t}$, which is the least $\ell$ for which any $\ell$ points can be divided into $k$ parts such that the convex hulls of any $t$ parts intersect. We prove the optimal bound $r_{k,t} = O_t(kr)$, in any $S_4$ separable space. In the other direction, we construct a separable space in which $r_k = Θ(r^2 k)$, while $r_{k,2}=Θ(rk)$. This proves that the weak version of Eckhoff's conjecture, which suggested that $r_k=O(rk)$ in any abstract convexity space, fails even in separable spaces. In addition, this shows that the abstract analogue of Reay's conjecture (1979), suggesting that $r_{k,2}=r_k$ in Euclidean spaces, already fails in separable convexity spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaya Keller, Skand Parvatikar, Tuan Tran. 2026-09-17. On colorful Helly numbers and the growth of Tverberg numbers. https://arxiv.org/abs/2608.06437

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Orthogonal Pairs in Maps from the Sphere to the Circle

We prove that, for any $f:S^2\to S^1$ and any $\varepsilon>0$, there exist orthogonal vectors $x,y\in S^2$ such that the length of the shortest arc between $f(x)$ and $f(y)$ is at most $π/2 +\varepsilon$. This proves a conjecture of Ghebleh from 2007 that the circular chromatic number of the real orthogonality graph is equal to four.

math.CO

Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles

For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11}{8};$ equality holds precisely when three areas equal $(3-\sqrt5)/4$ and two equal $(3\sqrt5-5)/8$. For seven triangles, $Δ(7)=r_7$, where $r_7$ is the unique root in $(0,1/4900)$ of $864r^4+2160r^3-6060r^2+4972r-1.$ Every minimizer has four areas $(1+3r_7)/7$ and three areas $(1-4r_7)/7$, although its geometry need not be unique. The proofs combine finite combinatorial classification with exact symbolic and integer-interval certificates. For nine triangles, a tilted-strip construction gives the explicit algebraic upper bound $Δ(9)\le 0.0001273496861283553341\ldots,$ which is the exact minimum within that topology. Conversely, every dissection in the complete single-cap two-rail zig-zag family, with arbitrary continuous areas, has range greater than $1/3500$; hence a global minimizer must lie outside that family. The exact value of $Δ(9)$ remains open.

math.CO

Chromatic symmetric functions for annular webs

We introduce a combinatorial definition of chromatic symmetric functions for annular webs. We prove their symmetry by constructing a web analogue of the Shareshian--Wachs involution and show that they coincide with the symmetric functions associated to annular webs via Turaev's isomorphism. We then derive explicit formulas for their hook Schur coefficients. We also introduce web LLT functions, whose hook Schur coefficients admit positive Laurent-polynomial formulas. These formulas yield a combinatorial expression for the coefficients of the HOMFLY--PT polynomial of an annular web.

math.CO