Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

On Tverberg partitions (1508.07262v2)

Published 28 Aug 2015 in math.CO

Abstract: A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of $n$ into $r$ parts (that is, $r$ integers $a_1,\ldots,a_r$ satisfying $n=a_1+\cdots+a_r$), where the parts $a_i$ correspond to the number of points in every subset. In this paper, we prove that for any partition $a_i\le d+1$, $i=1,\ldots,r$, there exists a set $X\subset\mathbb{R}d$ of $n$ points, such that every Tverberg partition of $X$ induces the same partition on $n$, given by the parts $a_1,\ldots,a_r$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.