Optimal asymptotic average line length under nonconcentration
Determine the optimal asymptotic upper bound, as the number of points tends to infinity in each fixed affine dimension, for the average length of lines spanned by complex point sets satisfying the stated uniform nonconcentration hypothesis.
References
For fixed dimension, their asymptotic optimality as $n\to\infty$ remains open.
— Ordinary lines, point degrees, and matroid density
(2610.21415 - Kroeker et al., 15 Oct 2026) in Section 3.1, immediately before Corollary 3.?, subsection “Incidences and line lengths under nonconcentration”
The constant in our theorem is not known to be sharp: even when no plane contains more than half of the points, the examples above leave the optimal asymptotic coefficient between $1/40$ and $1/12$.
— Ordinary lines, point degrees, and matroid density
(2610.21415 - Kroeker et al., 15 Oct 2026) in Section 1, paragraph following Theorem 1.?, “Ordinary lines under plane nonconcentration”
In particular, Campbell, Geelen, and Kroeker Conjecture~2.1 predict an upper bound of $3+o(1)$ for $n$ noncollinear points in the complex plane.
— Ordinary lines, point degrees, and matroid density
(2610.21415 - Kroeker et al., 15 Oct 2026) in Section 3.1, paragraph immediately before Corollary 3.?, subsection “Incidences and line lengths under nonconcentration”