pith. sign in

arxiv: 1201.2260 · v1 · pith:7SOVR5YAnew · submitted 2012-01-11 · 🧮 math.CO

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

Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco This is my paper
classification 🧮 math.CO
keywords sizearcscompletemaximumminimumclassificationdeterminingextremal
0
0 comments X
read the original 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).

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.