The number of occurrences of a fixed spread among n directions in vector spaces over finite fields
\textit{P. Erdős} et al. [Am. Math. Mon. 96, No. 7, 569--575 (1989; Zbl 0737.05006)] studied a problem of Leo Moser about how many times an angle can occur among \(n\) directions in the Euclidean 3-space. For the right angle the answer is \(O(n^{4/3})\), and for a generic angle little is known. The paper under review studies the analogous problem in the 3-dimensional geometry over the finite field \(\mathrm{GF}(q)\), where \(q\) is a large prime number. Recall that in a power of a finite field, the sum of squares of coordinate differences is the analogue of distance. Following Wildberger, the paper uses the algebraic concept of spread instead of the geometric concept of the angle. In Euclidean geometry, the spread is the square of the sine of the angle. The main result of the paper is that if \(E\) is a set of unit vectors in \(\mathrm{GF}(q)^3\) with \(q^{3/2} << |E| << q^2\), then for any \(\gamma\in\mathrm{GF}(q)\), the number of occurrences of the spread among elements of \(E\) is \(O(|E|^2/q)\), if \(1-\gamma\) is a square in \(\mathrm{GF}(q)\), otherwise zero.
- Distinct spreads in vector spaces over finite fields
- Occurrence of right angles in vector spaces over finite fields
- On point sets in vector spaces over finite fields that determine only acute angle triangles
- On directions determined by subsets of vector spaces over finite fields
- Erdös distance problem in vector spaces over finite fields
- A Furstenberg-Katznelson-Weiss type theorem on (d+1)-point configurations in sets of positive density in finite field geometries
- A Problem of Leo Moser About Repeated Distances on the Sphere
- A sum-product estimate in finite fields, and applications
- Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture
- Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points
- Divine proportions. Rational trigonometry to universal geometry.
- Erdös distance problem in vector spaces over finite fields
- Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
- Finite analogues of non-Euclidean spaces and Ramanujan graphs.
- scientific article; zbMATH DE number 2145248 (Why is no real title available?)
- On a Furstenberg-Katznelson-Weiss type theorem over finite fields
- On kaleidoscopic pseudo-randomness of finite Euclidean graphs
- On Sets of Distances of n Points
- On the number of orthogonal systems in vector spaces over finite fields
- Orthogonal systems in vector spaces over finite fields
- Pinned distance sets, k-simplices, Wolff's exponent in finite fields and sum-product estimates
- Research Problems in Discrete Geometry
- Sum-product Estimates in Finite Fields via Kloosterman Sums
- Sums and products in finite fields: an integral geometric viewpoint
- Survey of Spectra of Laplacians on Finite Symmetric Spaces
- The Erdős-Falconer distance problem on the unit sphere in vector spaces over finite fields
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The solvability of norm, bilinear and quadratic equations over finite fields via spectra of graphs
- The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
This page was built for publication: The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637739)
