Pach's Tangency Conjecture: Improved Bounds
Pach conjectured that Jordan arcs, pairwise crossing exactly once with no triple points, have tangent pairs. The best known bound stood at ; the paper improves it to (and in the at-most-one-crossing relaxation), plus a tight for a grounded x-monotone variant.
- Result
- Proved(see note)
- Status
- Partial result
- AI contribution
- AI-assisted
- Method
- Argument
- Field
- Combinatorial geometry
- Posed by
- János Pach
- Year posed
- —
- Years open
- —
- Solved
- 2026-03-12
- Model
- Gemini
- Vendor
- Google DeepMind
- Collaborators
- Eyal Ackerman, Balázs Keszegh
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 15 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Exponent improvements toward Pach's conjecture, which remains open.
What the AI did
"For the proof of Theorem 9 we used some back and forth interaction with Google's Large Language Model Gemini." One theorem of the paper, attributed plainly.