A recent breakthrough in computer-assisted mathematics showed that every set of 30 points in the plane in general position (i.e., without three on a common line) contains an empty convex hexagon, thus closing a line of research dating back to the 1930s.
Mar 26, 2024
Nov 19, 2023 · Heule and Scheucher solved this problem with a combination of geometric insights and automated reasoning techniques by constructing CNF formulas ...
Mar 26, 2024 · Overall, we hope that this work sets a new standard for verification when extensive computation is used for discrete geometry problems, and that ...
People also ask
What is the identification of hexagon?
The natural way to approach the empty-hexagon problem is to break hexagons into triangles and reason about whether each triangle has a point in its interior.
Mar 27, 2024 · ... Formal Verification of the Empty Hexagon Number" That is: formally verifying in Lean the "by-hand" encoding step of the recent SAT-solver ...
... Formal Verification of the Empty Hexagon Number. 15th International Conference on Interactive Theorem Proving (ITP 2024), 2024 lean4; Floris Doorn, Heather ...
Oct 31, 2024 · Hitarth gave the research talk. Formal Verification of the Empty Hexagon Number. Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio, ...