{
  "id": "1201.2260",
  "version": "v1",
  "published": "2012-01-11T08:31:10.000Z",
  "updated": "2012-01-11T08:31:10.000Z",
  "title": "The maximum and the minimum size of complete (n,3)-arcs in PG(2,16)",
  "authors": [
    "Daniele Bartoli",
    "Stefano Marcugini",
    "Fernanda Pambianco"
  ],
  "comment": "3 pages",
  "categories": [
    "math.CO"
  ],
  "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).",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-01-11T08:31:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "minimum size",
      "partial classification",
      "packing problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1201.2260B"
    }
  }
}