Minimal complete arcs in PG(2,q), q<= 32
classification
🧮 math.CO
keywords
arcscompletebeencomputer-baseddescribedexamplesminimalproof
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.