9781470460310 - The Finite Field Distance Problem di Covert, David J. (16 risultati)

Condizione: new.

Paperback. Condizione: New. 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.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Condizione: New.

Condizione: Fine. *Price HAS BEEN REDUCED by 10% until Monday, May 18 (weekend SALE item)* 181 pp., paperback, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Condizione: New. 2021. paperback. . . . . .

Paperback. Condizione: new. 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.

Paperback. Condizione: Brand New. 181 pages. 8.50x5.50x0.50 inches. In Stock.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New. 2021. paperback. . . . . . Books ship from the US and Ireland.

Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.

Condizione: As New. Unread book in perfect condition.

Paperback. Condizione: New. 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.

Paperback. Condizione: new. 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.