Polynomials in finite geometries and combinatorics

A. Blokhuis

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

8 Downloads (Pure)


It is illustrated how elementary properties of polynomials can be used to attack extremal problems in finite and euclidean geometry, and in combinatorics. Also a new result, related to the problem of neighbourly cylinders is presented.
Original languageEnglish
Title of host publicationSurveys in combinatorics
EditorsK. Walker
Place of PublicationCambridge
PublisherCambridge University Press
ISBN (Print)0-521-44857-3
Publication statusPublished - 1993

Publication series

NameLondon Mathematical Society Lecture Note Series
ISSN (Print)0076-0552


Dive into the research topics of 'Polynomials in finite geometries and combinatorics'. Together they form a unique fingerprint.

Cite this