Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T11:45:47.991Z Has data issue: false hasContentIssue false

LACUNARY POLYNOMIALS, MULTIPLE BLOCKING SETS AND BAER SUBPLANES

Published online by Cambridge University Press:  01 October 1999

A. BLOKHUIS
Affiliation:
Technical University Eindhoven, PO Box 513, 5600 MB Eindhoven, Netherlands; aartb@win.tue.nl
L. STORME
Affiliation:
University of Gent, FCW, Galglaan 2, 9000 Gent, Belgium; ls@cage.rug.ac.be
T. SZŐNYI
Affiliation:
Department of Computer Science, Eötvös Loránd University, Múzeum krt. 6–8, H-1088 Budapest, Hungary; szonyi@cs.elte.hu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

New lower bounds are given for the size of a point set in a Desarguesian projective plane over a finite field that contains at least a prescribed number s of points on every line. These bounds are best possible when q is square and s is small compared with q. In this case the smallest set is shown to be the union of disjoint Baer subplanes. The results are based on new results on the structure of certain lacunary polynomials, which can be regarded as a generalization of Rédei's results in the case when the derivative of the polynomial vanishes.

Information

Type
Notes and Papers
Copyright
The London Mathematical Society 1999