Can I read Maximal (n,3)-arcs in PG(2,11) on EtoBox?

Maximal (n,3)-arcs in PG(2,11) by Stefano Marcugini; Alfredo Milani; Fernanda Pambianco is a Computer Science article available to read on EtoBox.

What is Maximal (n,3)-arcs in PG(2,11) about?

In this paper we determine the largest size of a complete (n; 3)-arc in PG(2,11). By a computer-based exhaustive search that exploits the fact that an (n; 3)-arc with n¿21 contains an arc of size 7 and that uses projective equivalence properties, we show that the largest size of an (n; 3)-arc in PG(2,11) is 21 and that only two non-equivalent (21; 3)-arcs exist.

Who reads Maximal (n,3)-arcs in PG(2,11)?

Author

Stefano Marcugini; Alfredo Milani; Fernanda Pambianco

Publisher

Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)

Published

1999

Language

EN

Field

Computer Science (Physical Sciences)