Algebraic approach to the completeness problem for (k,n)-arcs in planes over finite fields

In a projective plane over a finite field, complete (k,n)-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the construction of small ones, with k close to the order of the plane, is considered a hard problem. A natural candidate to be a small (k,n)-arc with few characters is the set Ω(C) of the points of a plane curve C of degree n (containing no linear components) such that some line meets C transversally in the plane, i.e. in n pairwise distinct points. Let C be either the Hermitian curve of degree q+1 in PG(2,q2r) with r≥1, or the rational BKS curve of degree q+1 in PG(2,qr) with q odd and r≥1. Then Ω(C) has four and seven characters, respectively. Furthermore, Ω(C) is small as both curves are either maximal or minimal. The completeness problem is investigated by an algebraic approach based on Galois theory and on the Hasse-Weil lower bound. Our main result for the Hermitian case is that Ω(C) is complete for r≥4. For the rational BKS curve, Ω(C) is complete if and only if r is even. If r is odd then the uncovered points by the (q+1)-secants to Ω(C) are exactly the points in PG(2,q) not lying in Ω(C). Adding those points to Ω(C) produces a complete (k,q+1)-arc in PG(2,qr), with k=qr+q. The above results do not hold true for r=2 and there remain open the case r=3 for the Hermitian curve, and the cases r=3,4 for the rational BKS curve. As a by product we also obtain two results of interest in the study of the Galois inverse problem for PGL(2,q).