Indexed metadata

The number of Tverberg partitions beyond prime powers

Matija Blagojević, Pavle V. M. Blagojević

Source record

Source: arXiv

Published: Oct 23, 2026

arXiv: 2610.32086

Open original source ↗

Source abstract

Sierksma's conjecture asserts that every affine map a ⁣:Δ(d+1)(r−1)⟶Rda\colonΔ_{(d+1)(r-1)}\longrightarrow\mathbb{R}^d has at least ((r−1)!)d((r-1)!)^d unordered Tverberg partitions into rr parts. Until now, lower bounds growing with dd were known only when rr is a prime power. As one of our main results we prove that for every integer r≥3r\geq3, every decomposition r=kq+sr=kq+s into q=pαq=p^α a prime power, k≥1k\geq1 and s≥0s\geq0, and every affine map aa, the number Tv⁡(a)\operatorname{Tv}(a) of unordered Tverberg partitions satisfies Tv⁡(a) ≥ qr! (qα+1)⌈(r−1−2s)(d+1)2⌉. \operatorname{Tv}(a)\ \geq\ \frac{q}{r!}\,\Big(\frac{q}{α+1}\Big)^{\big\lceil\frac{(r-1-2s)(d+1)}{2}\big\rceil}.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

The number of Tverberg partitions beyond prime powers — Mathematical Frontier Network