Algebraic approach to the completeness problem for $(k,n)$-arcs in planes over finite fields
G\'abor Korchm\'aros, G\'abor P\'eter Nagy, Tam\'as Sz\H{o}nyi

TL;DR
This paper uses algebraic methods to analyze the completeness of certain small $(k,n)$-arcs derived from algebraic curves in finite projective planes, providing new criteria for their completeness based on Galois theory.
Contribution
It introduces an algebraic approach to determine the completeness of $(k,n)$-arcs from Hermitian and BKS curves, advancing understanding of their structure and properties in finite geometry.
Findings
Hermitian curve-based arcs are complete for $r \\ge 4$.
BKS curve-based arcs are complete if and only if $r$ is even.
Adding uncovered points yields larger complete arcs in certain cases.
Abstract
In a projective plane over a finite field, complete -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 close to the order of the plane, is considered a hard problem. A natural candidate to be a small -arc with few characters is the set of the points of a plane curve of degree (containing no linear components) such that some line meets transversally in the plane, i.e. in pairwise distinct points. Let be either the Hermitian curve of degree in with , or the rational BKS curve of degree in with odd and . Then has four and seven characters, respectively.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Graph theory and applications
