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 greater than or equal to 21 contains an are 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.
Maximal (n, 3)-arcs in PG(2, 11)
MILANI, Alfredo;
1999-01-01
Abstract
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 greater than or equal to 21 contains an are 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
