Approximate Caratheodory theorem
Additive combinatorics and its applications · Historical workshop question
Editorial mapping of AIMPL source category: Combinatorics. http://aimpl.org/addcombapp/ Not an author-supplied MSC code.
Problem statement
Q. First, assuming some assumptions on the point set , find a better dependence (sub-linear) on .
Q. Characterize configurations for which the bound is tight. status
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Question context
There is the following important theorem: Let be a finite set of points. Also assume that is contained in the unit Hamming ball for . Then any arbitrary point in the convex hull of can be approximated by a convex combination of only many points of .
Progress & source assessment
Historical workshop record. Current open/solved status has not been independently reassessed.
The source supplies no status note for this question.
- [1]Additive combinatorics and its applications link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.