On the size of a triple blocking set in \(\text{PG} (2,q)\)
A \(t\)-fold blocking set in a projective plane is a set \(S\) of points such that each line contains at least \(t\) points of \(S\). A polynomial is said to be lacunary if it contains a long string of zeroes. The author develops the theory of fully reducible lacunary polynomials over \(GF(q)\) and uses it to develop lower bounds on the size of 3-fold blocking sets in \(PG(2,q)\).
scientific article; zbMATH DE number 930067