Minimal complete arcs in PG(2,q), q<= 32

2010/05/19 by Stefano Marcugini, Marcugini, Stefano, Alfredo Milani +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1005.3412

6pages

arxiv created 2010/05/19 · openalex publication_date 2010/05/19 · arxiv updated 2010/05/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• New sizes of complete arcs in PG(2,q)
• Tables, bounds and graphics of the smallest known sizes of complete arcs in the plane PG(2,q) for all q≤160001 and sporadic q in the interval [160801… 430007]
• Upper bounds on the smallest size of a complete arc in the plane PG(2,q)
• On sizes of complete arcs in PG(2,q)
• The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)