AlphaEvolve problems·alphaevolve:48
Heilbronn problem in a fixed bounding box
No formal proof attached. Any claim here rests on a write-up or a report.
Fidelity F0: None. No formal statement is attached to the result.
For any $n \\geq 3$ and any convex body $K$ in the plane, let $C(n,K)$ be the largest quantity such that in every configuration of $n$ points in $K$, there exists a triple of points determining a triangle of area at most $C(n,K)$ times the area of $K$. Establish upper and lower bounds on $C(n,K)$.
AI activity
How grades workBest known construction at publication
Reasoning and sources
Autonomy
An evolutionary coding agent searching against an evaluator written by people, who also chose the problems.
Does the formal statement say what was claimed?
F0 no formal statement None. No formal statement is attached to the result.
Computed from what the project declares and what the register holds, never from reading the mathematics. How fidelity is graded.
Follow and discuss
All discussionGet an email when this problem moves
A new claim, a check, a bounty or a discussion. One link to confirm, one click to stop.
Discussion and bounties for this problem load here.