The finite-range upper-bound conjecture for complete arcs in projective planes

From papers

Let PG(2,q)PG(2,q) be the projective plane of order qq, and let t2(2,q)t_{2}(2,q) denote the smallest size of a complete arc in PG(2,q)PG(2,q). The finite-range upper-bound conjecture. In PG(2,q)PG(2,q),

t2(2,q)<5qfor q8192.t_{2}(2,q)<5\sqrt{q}\quad \text{for }q\leq 8192.

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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.