English

The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)

Combinatorics 2012-01-12 v1

Abstract

In this work we solve the packing problem for complete (n,3)-arcs in PG(2,16), determining that the maximum size is 28 and the minimum size is 15. We also performed a partial classification of the extremal size of complete (n,3)-arcs in PG(2,16).

Keywords

Cite

@article{arxiv.1201.2260,
  title  = {The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)},
  author = {Daniele Bartoli and Stefano Marcugini and Fernanda Pambianco},
  journal= {arXiv preprint arXiv:1201.2260},
  year   = {2012}
}

Comments

3 pages