The Finite Field Distance Problem (Paperback)

David J. Covert

ISBN 10: 1470460319 / ISBN 13: 9781470460310

Published by American Mathematical Society, Providence, 2021

About this Item

Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9781470460310

Bibliographic Details

• Title: The Finite Field Distance Problem (Paperback)
• Publisher: American Mathematical Society, Providence
• Publication Date: 2021
• Language: English
• ISBN 10: 1470460319
• ISBN 13: 9781470460310
• Binding: Paperback
• Condition: new

About this title

Synopsis

Erdős 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.

About the Author

David J. Covert: University of Missouri, St. Louis, MO