Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to actively explore the relatively new field of additive combinatorics. The author has written the book specifically for students of any background and proficiency level, from beginners to advanced researchers. It features an extensive menu of research projects that are challenging and engaging at many different levels. The questions are new and unsolved, incrementally attainable, and designed to be approachable with various methods.
The book is divided into five parts which are compared to a meal. The first part is called Ingredients and includes relevant background information about number theory, combinatorics, and group theory. The second part, Appetizers, introduces readers to the book’s main subject through samples. The third part, Sides, covers auxiliary functions that appear throughout different chapters. The book’s main course, so to speak, is Entrees: it thoroughly investigates a large variety of questions in additive combinatorics by discussing what is already known about them and what remains unsolved. These include maximum and minimum sumset size, spanning sets, critical numbers, and so on. The final part is Pudding and features numerous proofs and results, many of which have never been published.
- The first book of its kind to explore the subject
- Students of any level can use the book as the basis for research projects
- The text moves gradually through five distinct parts, which is suitable both for beginners without prerequisites and for more advanced students
- Includes extensive proofs of propositions and theorems
- Each of the introductory chapters contains numerous exercises to help readers
Table of Contents
Ingredients.Number theory. Divisibility of integers. Congruences.The Fundamental Theorem of Number Theory. Multiplicative number theory. Additive number theory. Combinatorics.Basic enumeration principles.Counting lists, sequences, sets, and multisets.Binomial coefficients and Pascal’s Triangle. Some recurrence relations. The integer lattice and its layers. Group theory. Finite abelian groups. Group isomorphisms. The Fundamental Theorem of Finite Abelian Groups. Subgroups and cosets. Subgroups generated by subsets. Sumsets. Appetizers. Spherical designs. Caps, centroids, and the game SET. How many elements does it take to span a group? In pursuit of perfection.The declaration of independence. Sides. Auxiliary functions. Entrees. Maximum sumset size. Spanning set. Sidon sets. Minimum sumset size. The critical number. Zero-sum-free sets. Sum-free sets. Pudding. Proof of Propositions and Theorems
Béla Bajnok is a Professor of Mathematics at Gettysburg College and an endowed Alumni Chair. He holds a Ph.D. from Ohio State University and has won several teaching awards, including the Creative Teaching Award at Gettysburg College and the Crawford Teaching Award from the Mathematical Association of America.