# On rich and poor directions determined by a subset of a finite plane

## TL;DR

This paper extends a finite plane geometry theorem to larger sets, showing that such sets are either contained in a few lines or determine many special directions, using a polynomial method with derivatives.

## Contribution

It generalizes the Rédéi-Szönyi theorem to larger sets and introduces a polynomial derivative approach to analyze direction multiplicities.

## Key findings

- Sets with more than p points are either contained in a few lines or determine many special directions.
- The polynomial method with iterated derivatives effectively studies direction multiplicities.
- The result bridges geometric configurations and algebraic polynomial techniques.

## Abstract

We generalize to sets with cardinality more than $p$ a theorem of R\'edei and Sz\H{o}nyi on the number of directions determined by a subset $U$ of the finite plane $\mathbb F_p^2$. A $U$-rich line is a line that meets $U$ in at least $\#U/p+1$ points, while a $U$-poor line is one that meets $U$ in at most $\#U/p-1$ points. The slopes of the $U$-rich and $U$-poor lines are called $U$-special directions. We show that either $U$ is contained in the union of $n=\lceil\#U/p\rceil$ lines, or it determines `many' $U$-special directions. The core of our proof is a version of the polynomial method in which we study iterated partial derivatives of the R\'edei polynomial to take into account the `multiplicity' of the directions determined by $U$.