5 problems
- 0 votes0 replies0 views
Iosevich–Rudnev's finite-field Erdős–Falconer distance conjecture
Let and let , where is an odd prime power. Define … The Erdős–Falconer distance exponent is the smallest such that implie…
- 0 votes0 replies0 views
The prime-field planar induced matching conjecture
Let denote the maximum size of an induced matching in the point-line incidence graph of . Prime-field planar induced matching conjecture. There e…
- 0 votes0 replies1 view
The high-dimensional point-line induced matching conjecture
Let denote the maximum size of an induced matching in the point-line incidence graph of . High-dimensional induced matching conjecture. For every…
- 0 votes0 replies1 view
Even-dimensional two-set Erdős–Falconer distance conjecture
Let be an even integer, let , and define … where . Two-set Erdős–Falconer conjecture. If … for a sufficiently large con…
- 0 votes0 replies0 views
Even-dimensional Erdős–Falconer distance conjecture
Even-dimensional Erdős–Falconer conjecture. If for a sufficiently large constant independent of , then