arXiv:1111.3403 [math.CO]AbstractReferencesReviewsResources
Upper bounds on the smallest size of a complete arc in the plane PG(2,q)
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco
Published 2011-11-15Version 1
New upper bounds on the smallest size t_{2}(2,q) of a complete arc in the projective plane PG(2,q) are obtained for q <= 9109. From these new bounds it follows that for q <= 2621 and q = 2659,2663,2683,2693,2753,2801, the relation t_{2}(2,q) < 4.5\sqrt{q} holds. Also, for q <= 5399 and q = 5413,5417,5419,5441,5443,5471,5483,5501,5521, we have t_{2}(2,q) < 4.8\sqrt{q}. Finally, for q <= 9067 it holds that t_{2}(2,q) < 5\sqrt{q}. The new upper bounds are obtained by finding new small complete arcs with the help of a computer search using randomized greedy algorithms.
Comments: 21 pages, 4 figures, 5 tables. arXiv admin note: substantial text overlap with arXiv:1011.3347
Related articles: Most relevant | Search more
On sizes of complete arcs in PG(2,q)
Tables, bounds and graphics of the smallest known sizes of complete arcs in the plane $\mathrm{PG}(2,q)$ for all $q\le160001$ and sporadic $q$ in the interval $[160801\ldots 430007]$
Daniele Bartoli, Alexander A. Davydov, Giorgio Faina, Alexey A. Kreshchuk, Stefano Marcugini, Fernanda Pambianco
New sizes of complete arcs in PG(2,q)