On the size of a triple blocking set in \(\text{PG} (2,q)\)
type: Item
instance of: scholarly article
title: On the size of a triple blocking set in \(\text{PG} (2,q)\)
zbMATH Open document ID: 0858.51003
author: Simeon Ball
published in: European Journal of Combinatorics
publication date: 1997-03-25T00:00:00Z
review text: 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)\).
Mathematics Subject Classification ID: 51E21
Mathematics Subject Classification ID: 12E20
zbMATH DE Number: 930067
zbMATH Keywords: lacunary polynomials
zbMATH Keywords: 3-fold blocking sets
reviewed by: Theodore G. Ostrom
MaRDI profile type: Publication
full work available at URL: eujc.1996.0036
OpenAlex ID: W1981781899
DOI: 10.1006/EUJC.1996.0036
Recommended article: On the size of a double blocking set in \(\text{PG}(2,q)\)
Recommended article: Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\)
Recommended article: On the size of a blocking set in \(\text{PG}(2,p)\)
Recommended article: Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
Recommended article: On the cardinality of blocking sets in PG(2,q)
Recommended article: Large blocking sets in \(\mathrm{PG}(2,q^2)\)
Recommended article: On 1-blocking sets in \(PG(n,q), n\geq 3\)
Recommended article: On large minimal blocking sets in PG(2,q)
Recommended article: Blocking sets in \(\mathrm{PG}(r,q^n)\)
Recommended article: Q3761202
description: scientific article; zbMATH DE number 930067