Combinatorial Analysis

This volume is dedicated to Fourier analysis, convex geometry, and related topics. The 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.

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.

A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.

A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions.

This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions.