Alex Iosevich – författare

Over the course of the last century, the systematic exploration of the relationship between Fourier analysis and other branches of mathematics has lead to important advances in geometry, number theory, and analysis, stimulated in part by Hurwitz’s proof of the isoperimetric inequality using Fourier series. This unified, self-contained book presents both a broad overview of Fourier analysis and convexity, as well as an intricate look at applications in some specific settings; it will be useful to graduate students and researchers in harmonic analysis, convex geometry, functional analysis, number theory, computer science, and combinatorial analysis. A wide audience will benefit from the careful demonstration of how Fourier analysis is used to distill the essence of many mathematical problems in a natural and elegant way.

The Erd s 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 Erd s 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 Erd s combinatorics.

Over the course of the last century, the systematic exploration of the relationship between Fourier analysis and other branches of mathematics has lead to important advances in geometry, number theory, and analysis, stimulated in part by Hurwitz’s proof of the isoperimetric inequality using Fourier series. This unified, self-contained book presents both a broad overview of Fourier analysis and convexity, as well as an intricate look at applications in some specific settings; it will be useful to graduate students and researchers in harmonic analysis, convex geometry, functional analysis, number theory, computer science, and combinatorial analysis. A wide audience will benefit from the careful demonstration of how Fourier analysis is used to distill the essence of many mathematical problems in a natural and elegant way.

The Plancherel formula says that the L^2 norm of the function is equal to the L^2 norm of its Fourier transform. This implies that at least on average, the Fourier transform of an L^2 function decays at infinity. This book is dedicated to the study of the rate of this decay under various assumptions and circumstances, far beyond the original L^2 setting. Analytic and geometric properties of the underlying functions interact in a seamless symbiosis which underlines the wide range influences and applications of the concepts under consideration.​