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. Both the complete (28,3)-arc and the complete (15,3)-arc are unique up to collineations.
The maximum and the minimum sizes of complete (n,3)-arcs inPG(2,16)
BARTOLI, DANIELE;MARCUGINI, Stefano;PAMBIANCO, Fernanda
2012
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. Both the complete (28,3)-arc and the complete (15,3)-arc are unique up to collineations.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.
