A remark on blocking sets of almost Rédei type (Q1375938): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Blocking sets of almost Rédei type / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3319331 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two remarks on blocking sets and nuclei in planes of prime order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Baer subplanes and blocking sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the size of a blocking set in \(\text{PG}(2,p)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of directions determined by a function \(f\) on a finite field / rank | |||
Normal rank |
Revision as of 10:14, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A remark on blocking sets of almost Rédei type |
scientific article |
Statements
A remark on blocking sets of almost Rédei type (English)
0 references
21 January 1998
0 references
This paper completes the classification of blocking sets of almost Rédei type in the Desarguesian planes of prime order. The notion of blocking set of almost Rédei type has been introduced by A. Blokhuis, R. Pellikaan and T. Szönyi [\textit{A. Blokhuis} and \textit{R. Pellikaan}, J. Comb. Theory, Ser. A 78, No. 1, 141-150 (1997; Zbl 0877.51010)] and it is a minimum size blocking set in \(\text{PG} (2,p)\) (hence containing \(3 {p+1 \over 2}\) points) meeting some line \(L\) in at least \({p+3 \over 2}- {p+45 \over 20}\) points \((p\) a prime number). In the above mentioned paper, the authors prove that in this case the maximum number of points of the blocking set off a line is \(p\), \(p+1\), or \(p+2\). Since all blocking sets of almost Rédei type in the cases \(p\) and \(p+1\) have been classified before (by \textit{L. Lovász} and \textit{A. Schrijver} [Stud. Sci. Math. Hung. 16, 449-454 (1981; Zbl 0535.51009)] and by \textit{A. Gács} , \textit{P. Sziklai} and \textit{T. Szönyi} [Des. Codes Cryptography 10, No. 1, 29-39 (1997; Zbl 0874.51002)] respectively), the paper under review treats the case \(p+2\). It is shown that necessarily \(p=3,5,7\) and in each case there is a unique example. The author uses mainly algebraic methods (relating a polynomial to a blocking set in the ``usual'' way).
0 references
Newton formulae
0 references
blocking sets
0 references
Rédei type
0 references