English

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

Combinatorics 2010-05-20 v1

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.

Keywords

Cite

@article{arxiv.1005.3412,
  title  = {Minimal complete arcs in PG(2,q), q<= 32},
  author = {Stefano Marcugini and Alfredo Milani and Fernanda Pambianco},
  journal= {arXiv preprint arXiv:1005.3412},
  year   = {2010}
}

Comments

6pages

R2 v1 2026-06-21T15:24:57.389Z