The goal of this monograph is to give an accessible introduction to nonstandard methods and their applications, with an emphasis on combinatorics and Ramsey theory. It includes both new nonstandard proofs of classical results and recent developments initially obtained in the nonstandard setting. This makes it the first combinatorics-focused account of nonstandard methods to be aimed at a general (graduate-level) mathematical audience. This book will provide a natural starting point for researchers interested in approaching the rapidly growing literature on combinatorial results obtained via nonstandard methods. The primary audience consists of graduate students and specialists in logic and combinatorics who wish to pursue research at the interface between these areas.

Presents the first introduction to nonstandard methods geared towards combinatorics Includes new nonstandard proofs of classical results in Ramsey theory Provides a self-contained introduction to the literature of nonstandard methods in combinatorics Numerous exercises help readers to familiarize themselves with the material

Inhalt

Part I Preliminaries. - Ultrafilters. - Nonstandard Analysis. - Hyperfinite Generators of Ultrafilters. - Many Stars: Iterated Nonstandard Extensions. - LoebMeasure. - Part II Ramsey Theory. - Ramsey's Theorem. - The Theorems of van der Waerden and Hales-Jewett. - From Hindman to Gowers. - Partition Regularity of Equations. - Part III Combinatorial Number Theory . - Densities and Structural Properties. - Working in the Remote Realm. - Jin's Sumset Theorem. - Sumset Configurations in Sets of Positive Density. - Near Arithmetic Progressions in Sparse Sets. - The Interval Measure Property. - Part IV Other Topics. - Triangle Removal and Szemerédi Regularity. - Approximate Groups. - Foundations of Nonstandard Analysis.