64 problems
Let and let , where is an odd prime power. Define … The Erdős–Falconer distance exponent is the smallest such that implie…
Erdős's conjecture. There exists such that no crescent configurations of size exist for all .
Let an integral circular point set be a finite set of points on a circle in the Euclidean plane such that the distance between every pair of points is an integer. Anning's conjectu…
Conway and Sloane's conjecture. For all sufficiently large, an optimal set of points in -dimensional space should be a subset of an -dimensional lattice having minima…
The 3-connected Laman graph non-solvability conjecture. If a generic Laman graph is -connected, then its constraint equations are not solvable by radicals (not-RS).
Spherical Erdős distance conjecture. On , the Erdős distance conjecture should hold without the logarithmic factor; that is, should determine at least a constant times …
Let be a field of characteristic . For each , let denote the set of positive distances that are forced by finite unit-distance configuratio…
Let , let be a field of characteristic , and let a map preserve unit distance, meaning that whenever…
Let be a compact set, and let … The Hausdorff dimension of equal to should suffice to ensure that has positive Lebesgue measure. Graf…
Large minimal-distance conjecture. There is a fixed constant such that the minimal distance is at least
Large minimal-distance conjecture. There is a fixed constant such that the minimal distance is at least
Let be an -point set in Euclidean space whose pairwise distances are mutually separated by at least , and let denote its diamet…
Maximizer structure conjecture. The following properties hold:
Let be a Schubert variety in . GD-degree conjecture. If , then the Schubert variety has GD degree . The paper rep…
Let be a curve, and let the Chow threefold and secant surface associated with have Grassmannian-distance degree and…
Let be a curve, and consider the associated Chow threefold, secant surface, and tangent curve of lines, together with a data line and an optimal li…
Let a surface in be defined by generic polynomials of degrees , and let a threefold in be defined by a generic polynomial of degree …
Perturbation conjecture. For every , there is a set in bijective correspondence with such that each corresponding pair satisfies…
For a configuration of points in , let denote the largest number of pairs realizing the same distance. Let be a constant independent of . Erdős…
For an -point configuration in , let denote the smallest number of distinct pairwise distances that can occur among its points. Here is a constant i…
Minimal-distance lower-bound conjecture. For all ,
Let , with . Let denote the map used to define the second-order osculating construction, let …
Let be an even integer, let , and define … where . Two-set Erdős–Falconer conjecture. If … for a sufficiently large con…
Even-dimensional Erdős–Falconer conjecture. If for a sufficiently large constant independent of , then