-PDF Download- The Finite Field Distance Problem EBOOK

The Finite Field Distance Problem

Author: David J. Covert

Publisher: American Mathematical Soc.

Published: 2021-06-21

Total Pages: 181

ISBN-13: 1470460319

Erdős asked how many distinct distances must there be in a set of n 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 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 Erdos Distance Problem

Author: Julia Garibaldi

Publisher: American Mathematical Soc.

Published: 2011

Total Pages: 166

ISBN-13: 0821852817

DOWNLOAD EBOOK →

Introduces the reader to the techniques, ideas, and consequences related to the Erdős problem. The authors introduce these concepts in a concrete and elementary way that allows a wide audience to absorb the content and appreciate its far-reaching implications. In the process, the reader is familiarized with a wide range of techniques from several areas of mathematics and can appreciate the power of the resulting symbiosis.

Integers

Author: Bruce Landman

Publisher: Walter de Gruyter GmbH & Co KG

Published: 2014-06-18

Total Pages: 1092

ISBN-13: 3110298163

DOWNLOAD EBOOK →

"Integers" is a refereed online journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. Topics covered by the journal include additive number theory, multiplicative number theory, sequences and sets, extremal combinatorics, Ramsey theory, elementary number theory, classical combinatorial problems, hypergraphs, and probabilistic number theory. Integers also houses a combinatorial games section. This work presents all papers of the 2013 volume in book form.

The Erdös Distance Problem

Author: Julia Garibaldi

Publisher: American Mathematical Soc.

Published:

Total Pages: 166

ISBN-13: 0821884727

DOWNLOAD EBOOK →

The Erds problem asks, What is the smallest possible number of distinct distances between points of a large finite subset of the Euclidean space in dimensions two and higher? The main goal of this book is to introduce the reader to the techniques, ideas, and consequences related to the Erds problem. The authors introduce these concepts in a concrete and elementary way that allows a wide audience--from motivated high school students interested in mathematics to graduate students specializing in combinatorics and geometry--to absorb the content and appreciate its far-reaching implications. In the process, the reader is familiarized with a wide range of techniques from several areas of mathematics and can appreciate the power of the resulting symbiosis. The book is heavily problem oriented, following the authors' firm belief that most of the learning in mathematics is done by working through the exercises. Many of these problems are recently published results by mathematicians working in the area. The order of the exercises is designed both to reinforce the material presented in the text and, equally importantly, to entice the reader to leave all worldly concerns behind and launch head first into the multifaceted and rewarding world of Erds combinatorics.

Combinatorics and Finite Fields

Author: Kai-Uwe Schmidt

Publisher: Walter de Gruyter GmbH & Co KG

Published: 2019-07-08

Total Pages: 506

ISBN-13: 3110641968

DOWNLOAD EBOOK →

The series is devoted to the publication of high-level monographs, surveys and proceedings which cover the whole spectrum of computational and applied mathematics. The books of this series are addressed to both specialists and advanced students. Interested authors may submit book proposals to the Managing Editor or to any member of the Editorial Board. Managing EditorUlrich Langer, Johannes Kepler University Linz, Austria Editorial BoardHansj rg Albrecher, University of Lausanne, SwitzerlandRonald H. W. Hoppe, University of Houston, USAKarl Kunisch, RICAM, Linz, Austria; University of Graz, AustriaHarald Niederreiter, RICAM, Linz, AustriaChristian Schmeiser, University of Vienna, Austria

Finite Fields and Their Applications

Author: Pascale Charpin

Publisher: Walter de Gruyter

Published: 2013-05-28

Total Pages: 288

ISBN-13: 3110283603

DOWNLOAD EBOOK →

This book is based on the invited talks of the "RICAM-Workshop on Finite Fields and Their Applications: Character Sums and Polynomials" held at the Federal Institute for Adult Education (BIfEB) in Strobl, Austria, from September 2-7, 2012. Finite fields play important roles in many application areas such as coding theory, cryptography, Monte Carlo and quasi-Monte Carlo methods, pseudorandom number generation, quantum computing, and wireless communication. In this book we will focus on sequences, character sums, and polynomials over finite fields in view of the above mentioned application areas: Chapters 1 and 2 deal with sequences mainly constructed via characters and analyzed using bounds on character sums. Chapters 3, 5, and 6 deal with polynomials over finite fields. Chapters 4 and 9 consider problems related to coding theory studied via finite geometry and additive combinatorics, respectively. Chapter 7 deals with quasirandom points in view of applications to numerical integration using quasi-Monte Carlo methods and simulation. Chapter 8 studies aspects of iterations of rational functions from which pseudorandom numbers for Monte Carlo methods can be derived. The goal of this book is giving an overview of several recent research directions as well as stimulating research in sequences and polynomials under the unified framework of character theory.

Issues in General and Specialized Mathematics Research: 2013 Edition

Author:

Publisher: ScholarlyEditions

Published: 2013-05-01

Total Pages: 1217

ISBN-13: 1490106928

DOWNLOAD EBOOK →

Issues in General and Specialized Mathematics Research: 2013 Edition is a ScholarlyEditions™ book that delivers timely, authoritative, and comprehensive information about General Mathematics. The editors have built Issues in General and Specialized Mathematics Research: 2013 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about General Mathematics in this book to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in General and Specialized Mathematics Research: 2013 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

Towards a Theory of Geometric Graphs

Author: János Pach

Publisher: American Mathematical Soc.

Published: 2004

Total Pages: 300

ISBN-13: 0821834843

DOWNLOAD EBOOK →

This volume contains a collection of papers on graph theory, with the common theme that all the graph theoretical problems addressed are approached from a geometrical, rather than an abstract point of view. This is no accident; the editor selected these papers not as a comprehensive literature revie

Computational and Algorithmic Problems in Finite Fields

Author: Igor Shparlinski

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 253

ISBN-13: 940111806X

DOWNLOAD EBOOK →

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Analysis at Large

Author: Artur Avila

Publisher: Springer Nature

Published: 2022-11-01

Total Pages: 388

ISBN-13: 3031053311

DOWNLOAD EBOOK →

Analysis at Large is dedicated to Jean Bourgain whose research has deeply influenced the mathematics discipline, particularly in analysis and its interconnections with other fields. In this volume, the contributions made by renowned experts present both research and surveys on a wide spectrum of subjects, each of which pay tribute to a true mathematical pioneer. Examples of topics discussed in this book include Bourgain’s discretized sum-product theorem, his work in nonlinear dispersive equations, the slicing problem by Bourgain, harmonious sets, the joint spectral radius, equidistribution of affine random walks, Cartan covers and doubling Bernstein type inequalities, a weighted Prékopa-Leindler inequality and sumsets with quasicubes, the fractal uncertainty principle for the Walsh-Fourier transform, the continuous formulation of shallow neural networks as Wasserstein-type gradient flows, logarithmic quantum dynamical bounds for arithmetically defined ergodic Schrödinger operators, polynomial equations in subgroups, trace sets of restricted continued fraction semigroups, exponential sums, twisted multiplicativity and moments, the ternary Goldbach problem, as well as the multiplicative group generated by two primes in Z/QZ. It is hoped that this volume will inspire further research in the areas of analysis treated in this book and also provide direction and guidance for upcoming developments in this essential subject of mathematics.