Minimal complete arcs in PG(2,q), q<= 32
Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
TL;DR
This paper confirms through computational proof that the smallest complete arcs in PG(2,31) and PG(2,32) are of size 14, providing explicit examples of such arcs.
Contribution
It verifies the minimal size of complete arcs in PG(2,q) for q=31 and 32 using computer-based methods and supplies explicit arc examples.
Findings
Smallest complete arcs in PG(2,31) and PG(2,32) are of size 14.
Computer-based proof confirms minimal arc sizes.
Explicit examples of these arcs are provided.
Abstract
In this paper it has been verified, by a computer-based proof, that the smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some examples of such arcs are also described.
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 · graph theory and CDMA systems · Coding theory and cryptography