A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2,q)$$ PG ( 2 , q )
A new lower bound for the smallest complete (k, n)-arc in $$\mathrm {PG}(2,q)$$ PG ( 2 , q )
In $$\mathrm {PG}(2,q)$$ , the projective plane over the field $$\mathbf{F}_{q}$$ of q elements, a (k, n)-arc is a set $$\mathcal {K}$$ of k points with at most n points on any line of the plane. A fundamental question is to determine the values of k for which $$\mathcal {K}$$ …