Algebraic constructions of complete -arcs
arXiv:2007.00911
Abstract
Let be a positive integer, be a prime power, and be the projective plane over the finite field . Finding complete -arcs in of size less than is a classical problem in finite geometry. In this paper we give a complete answer to this problem when is relatively large compared with , explicitly constructing the smallest -arcs in the literature so far for any . For any fixed , our arcs satisfy as grows. To produce such -arcs, we develop a Galois theoretical machinery that allows the transfer of geometric information of points external to the arc, to arithmetic one, which in turn allows to prove the -completeness of the arc.