On the size of a triple blocking set in \(\text{PG} (2,q)\) (Q1922870)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the size of a triple blocking set in \(\text{PG} (2,q)\) |
scientific article; zbMATH DE number 930067
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the size of a triple blocking set in \(\text{PG} (2,q)\) |
scientific article; zbMATH DE number 930067 |
Statements
On the size of a triple blocking set in \(\text{PG} (2,q)\) (English)
0 references
25 March 1997
0 references
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)\).
0 references
lacunary polynomials
0 references
3-fold blocking sets
0 references
0.95487624
0 references
0.95217913
0 references
0.94592464
0 references
0.9323318
0 references
0.92715275
0 references
0.9204198
0 references
0 references
0.9189876
0 references
0.91555905
0 references
