The finite-range upper-bound conjecture for complete arcs in projective planes
Let be the projective plane of order , and let denote the smallest size of a complete arc in . The finite-range upper-bound conjecture. In ,
This conjecture gives a uniform numerical bound over the specified finite range of plane orders, extending the computational estimates discussed in the source. The supplied source gives no evidence that it has been resolved.
References
Primary source
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini and Fernanda Pambianco, “Upper bounds on the smallest size of a complete arc in the plane PG(2,q)”, arXiv:1111.3403 (2011).
Progress summary
Never refreshed
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.