A new proof of R\'edei's theorem on the number of directions
Gabor Somlai

TL;DR
This paper presents a concise new proof of Rédéi's theorem on the number of directions determined by subsets in finite fields, utilizing a lemma by Kiss and the author, and extends to polynomial results over finite fields.
Contribution
The paper offers a novel, shorter proof of Rédéi's theorem and introduces an extension involving polynomials over finite fields.
Findings
Confirmed the minimal number of directions as either 1 or at least (p+3)/2.
Provided a simplified proof method using a key lemma.
Extended the result to polynomial contexts over finite fields.
Abstract
R\'edei and Megyesi proved that the number of directions determined by a element subset of is either or at least . The same result was independently obtained by Dress, Klin and Muzychuk. We give a new and short proof of this result using a Lemma proved by Kiss and the author. The new proof further on a result on polynomials over finite fields.
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
TopicsCoding theory and cryptography · Analytic Number Theory Research · Limits and Structures in Graph Theory
