The finite field distance problem
Author(s)
Bibliographic Information
The finite field distance problem
（The Carus mathematical monographs, v. 37）
MAA Press, c2021
- : pbk
Available at / 7 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: pbkCOV||2||1200043152747
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 169-178) and index
Description and Table of Contents
Description
Erdos asked how many distinct distances must there be in a set of $n$ points in the plane. Falconer asked a continuous analogue, essentially asking what is the minimal Hausdorff dimension required of a compact set in order to guarantee that the set of distinct distances has positive Lebesgue measure in $R$. The finite field distance problem poses the analogous question in a vector space over a finite field. The problem is relatively new but remains tantalizingly out of reach. This book provides an accessible, exciting summary of known results. The tools used range over combinatorics, number theory, analysis, and algebra. The intended audience is graduate students and advanced undergraduates interested in investigating the unknown dimensions of the problem. Results available until now only in the research literature are clearly explained and beautifully motivated. A concluding chapter opens up connections to related topics in combinatorics and number theory: incidence theory, sum-product phenomena, Waring's problem, and the Kakeya conjecture.
Table of Contents
Background
The distance problem
The Iosevich-Rudnev bound
Wolff's exponent
Rings and generalized distances
Configurations and group actions
Combinatorics in finite fields
Bibliography
Index
by "Nielsen BookData"