We still haven't determined the exact smallest number of unit distances that must repeat among any large set of points drawn on a plane.

open Global / Unspecified, Global WS01266

This problem, part of a broader family of questions in combinatorial geometry, has known bounds but no exact general formula for every configuration. Solving it would refine our understanding of how simple geometric constraints shape complex arrangements.

mathematics-logic global-unspecified exact haven determined smallest number unit distances must repeat among whether know possible every resolved philosophy-ethics

Category: Mathematics Logic

Added by: The Internet (curious_mind93)

Created at: 2026-07-19T16:18:35Z

Click to copy citation

WS01266 | World Solve | https://worldsolve.org/index.php?view=problem&id=1266

Related Problems

We haven't determined whether every finite set of geometric points can always be enclosed within a uniquely defined smallest possible shape of a specific type.

WS01348 · Match Score: 29%

We still haven't resolved whether every finite set of straight lines drawn on a plane must always create at least one region shaped like a specific simple polygon.

WS01287 · Match Score: 23%

We haven't resolved whether it's possible to guarantee an exact, efficient method for finding the shortest possible network connecting any given set of points.

WS01315 · Match Score: 22%

We haven't determined whether every finite geometric shape can always be perfectly reconstructed from a limited set of simple measurements.

WS01302 · Match Score: 21%

We haven't proven whether there's a general method for determining the exact number of ways any given shape can be divided into smaller identical pieces.

WS01296 · Match Score: 20%