Number of directions determined by a set in \(\mathbb{F}_q^2\) and growth in \(\mathrm{Aff}(\mathbb{F}_q)\) (Q2665267)

Let \(A\) be a set of points in the affine plane \(\mathrm{AG}(2,q)\), described via \(\mathbb{F}_q^2\), where \(\mathbb{F}_q\) is the finite field of order \(q\). The set of directions defined by this set \(A\) is the set of the directions of the lines passing through at least two points of this set. There are results known on the number of directions defined by a set \(A\) in \(\mathbb{F}_p^2\), \(p\) prime. \textit{T. Szőnyi} [Discrete Math. 208--209, 557--575 (1999; Zbl 0952.11027)] proved that if \(p\) is prime, and \(A\) is a set of points of \(\mathbb{F}_p^2\), with \(1 < |A| \leq p\), then either \(A\) is contained in a line or \(A\) spans at least \((|A| + 3)/2\) directions. This result was then used by \textit{M. Rudnev} and \textit{I. D. Shkredov} [``On growth rate in \(\mathrm{SL}_2(\mathbb{F}_p)\), the affine group and sum-product type implications'', Preprint, \url{arXiv:1812.01671}] to obtain a new result, stated in Theorem 1.2 of this article. The author extends results on the number of directions defined by a set \(A\) in \(\mathbb{F}_q^2\) to general prime powers \(q\). The author first of all extends the result of Szőnyi [loc. cit.] to the following result: Theorem 1.3: Let \(q = p^e\), \(p\) prime, \(e\geq 1\), and let \(A\) be a set of points in \(\mathbb{F}_q^2\), with \(1 < |A| \leq q\). Then either the set \(A\) is contained in a line or the set \(A\) spans more than \begin{itemize} \item[(a)] \( |A|/\sqrt{q}\) directions for \(e\) even, \item[(b)] \(|A|/(p^{(e-1)/2} + 1)\) directions for \(e\) odd. \end{itemize} This result, valid for general \(q\) a prime power, is then used to extend the result of Rudnev and Shkredov [loc. cit.], stated in Theorem 1.2 of this article, to a general result, stated in Theorem 1.4 of this article. Theorem 2.2 of this article also states an upper bound on the number of directions defined by a set of points \(A\) in \(\mathbb{F}_q^2\). This upper bound is similar to an upper bound, derived by \textit{S. L. Fancsali} et al. [J. Algebr. Comb. 37, No. 1, 27--37 (2013; Zbl 1270.51009)]. The author relies on Rédei polynomials and polynomial techniques to obtain these generalized results over finite fields \(\mathbb{F}_q\), \(q\) a prime power.