Erdős Problem #96 — Unit distances in convex polygons
For an integer , let be the set of the distinct vertices of a convex -gon, and let count unordered pairs of distinct vertices at Euclidean distance exactly . The question is whether there is an absolute constant such that, for every and every such ,
Equivalently, is the maximum of over convex -gons as grows? Erdős Problem #96 On Unit Distances in a Convex Polygon
Background
This is a structured version of the planar unit-distance problem: instead of maximizing over arbitrary sets of points, one restricts to the vertices of a convex polygon. Erdős and Moser posed the convex-polygon variant in 1959 and conjectured that its maximum is of linear order. Their initial lower bound was at least . The linear conjecture is commonly associated with Erdős and Moser; Erdős later credited the sharper proposed bound to himself and Fishburn. Erdős Problem #96 On Unit Distances in a Convex Polygon
The convexity restriction makes the problem amenable to combinatorial encodings unavailable for arbitrary point sets. In particular, the upper-bound approach described for this problem represents convex-polygon distances using – matrices. This converts geometric restrictions on the vertices into constraints on patterns of unit-distance incidences, and gives bounds sharper than the general planar unit-distance estimate. On Unit Distances in a Convex Polygon
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.