A computer search in the finite projective spaces PG(n, q) for the spectrum of possible sizes k of complete k-caps is done. Randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete cap are given for many values of n and q. Many new sizes of complete caps are obtained.
Complete caps in projective spaces PG(n,q)
MARCUGINI, Stefano;PAMBIANCO, Fernanda
2004
Abstract
A computer search in the finite projective spaces PG(n, q) for the spectrum of possible sizes k of complete k-caps is done. Randomized greedy algorithms are applied. New upper bounds on the smallest size of a complete cap are given for many values of n and q. Many new sizes of complete caps are obtained.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.
