Combinatorial problems in finite geometry and lacunary polynomials
Aart Blokhuis
TL;DR
This paper explores combinatorial problems in finite projective planes and demonstrates how lacunary polynomials, via Rédéi's theory, can be used to analyze these problems.
Contribution
It introduces a novel application of lacunary polynomial theory to solve combinatorial problems in finite geometry.
Findings
Application of Rédéi's theory to finite projective plane problems
New insights into combinatorial structures in finite geometry
Potential for further research using lacunary polynomials
Abstract
We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Combinatorial Mathematics · Mathematics and Applications