Algebraic constructions of complete m-arcs

DOI10.1007/S00493-021-4712-5MaRDI QIDQ6344255arXivFDO

Authors Daniele Bartoli, Giacomo Micheli

Publication date 2 July 2020

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21) Density theorems (11R45)

Abstract: Let $m$ be a positive integer, $q$ be a prime power, and $mathrmPG(2,q)$ be the projective plane over the finite field $mathbb{F}_q$. Finding complete $m$-arcs in $mathrmPG(2,q)$ of size less than $q$ is a classical problem in finite geometry. In this paper we give a complete answer to this problem when $q$ is relatively large compared with $m$, explicitly constructing the smallest $m$-arcs in the literature so far for any $mgeq8$. For any fixed $m$, our arcs $mathcal{A}_{q,m}$ satisfy $|mathcal{A}_{q,m}|-qightarrow-infty$ as $q$ grows. To produce such $m$-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 $m$-completeness of the arc.

This page was built for publication: Algebraic constructions of complete $m$-arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344255)