Unit-Area Triangles in Planar Sets of Large Measure
How large can a measurable be while avoiding the vertices of upward-oriented axis-aligned right triangles of area ? At most , with a matching-shaped lower bound construction.
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Harmonic analysis
- Posed by
- Ronald Graham
- Year posed
- —
- Years open
- —
- Solved
- 2026-05-28
- Model
- ChatGPT 5.4 Pro, Gemini 3.1 Pro
- Vendor
- OpenAI / Google
- Collaborators
- Aleksandar Bulj, Vjekoslav Kovac
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 15 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The AI usage declaration names two distinct contributions: ChatGPT 5.4 Pro constructed the example giving the lower bound, and was also used to clarify a cryptic remark of Graham and reconstruct its intended proof. Gemini drew a figure. The authors state the ideas, proofs and writing are theirs.
Verification
arXiv preprint; not yet peer-reviewed.
Source
arXiv:2605.30033 - On hyperbolic corners and unit-area triangles in planar sets of large measure