Graduate text focusing on algebraic methods that can be applied to prove the Erdős-Ko-Rado Theorem and its generalizations.

The McKay conjecture is the origin of the counting conjectures in the representation theory of finite groups. This book gives a comprehensive introduction to these conjectures, while assuming minimal background knowledge. Character theory is explored in detail along the way, from the very basics to the state of the art. This includes not only older theorems, but some brand new ones too. New, elegant proofs bring the reader up to date on progress in the field, leading to the final proof that if all finite simple groups satisfy the inductive McKay condition, then the McKay conjecture is true. Open questions are presented throughout the book, and each chapter ends with a list of problems, with varying degrees of difficulty.

Modern text examining the interplay between measure theory and Fourier analysis.

A detailed and self-contained introduction to a key part of local number theory, ideal for graduate students and researchers.

There have been remarkably few systematic expositions of the theory of derived categories since its inception in the work of Grothendieck and Verdier in the 1960s. This book is the first in-depth treatment of this important component of homological algebra. It carefully explains the foundations in detail before moving on to key applications in commutative and noncommutative algebra, many otherwise unavailable outside of research articles. These include commutative and noncommutative dualizing complexes, perfect DG modules, and tilting DG bimodules. Written with graduate students in mind, the emphasis here is on explicit constructions (with many examples and exercises) as opposed to axiomatics, with the goal of demystifying this difficult subject. Beyond serving as a thorough introduction for students, it will serve as an important reference for researchers in algebra, geometry and mathematical physics.

Praise for the Third Edition “Researchers of any kind of extremal combinatorics or theoretical computer science will welcome the new edition of this book.” - MAA Reviews Maintaining a standard of excellence that establishes The Probabilistic Method as the leading reference on probabilistic methods in combinatorics, the Fourth Edition continues to feature a clear writing style, illustrative examples, and illuminating exercises. The new edition includes numerous updates to reflect the most recent developments and advances in discrete mathematics and the connections to other areas in mathematics, theoretical computer science, and statistical physics. Emphasizing the methodology and techniques that enable problem-solving, The Probabilistic Method, Fourth Edition begins with a description of tools applied to probabilistic arguments, including basic techniques that use expectation and variance as well as the more advanced applications of martingales and correlation inequalities. The authors explore where probabilistic techniques have been applied successfully and also examine topical coverage such as discrepancy and random graphs, circuit complexity, computational geometry, and derandomization of randomized algorithms. Written by two well-known authorities in the field, the Fourth Edition features: Additional exercises throughout with hints and solutions to select problems in an appendix to help readers obtain a deeper understanding of the best methods and techniques New coverage on topics such as the Local Lemma, Six Standard Deviations result in Discrepancy Theory, Property B, and graph limits Updated sections to reflect major developments on the newest topics, discussions of the hypergraph container method, and many new references and improved results The Probabilistic Method, Fourth Edition is an ideal textbook for upper-undergraduate and graduate-level students majoring in mathematics, computer science, operations research, and statistics. The Fourth Edition is also an excellent reference for researchers and combinatorists who use probabilistic methods, discrete mathematics, and number theory. Noga Alon, PhD, is Baumritter Professor of Mathematics and Computer Science at Tel Aviv University. He is a member of the Israel National Academy of Sciences and Academia Europaea. A coeditor of the journal Random Structures and Algorithms, Dr. Alon is the recipient of the Polya Prize, The Gödel Prize, The Israel Prize, and the EMET Prize. Joel H. Spencer, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is a Sloane Foundation Fellow. Dr. Spencer has written more than 200 published articles and is the coauthor of Ramsey Theory, Second Edition, also published by Wiley.

Among other subjects explored are the Clements-Lindström extension of the Kruskal-Katona theorem to multisets and the Greene-Kleitmen result concerning k-saturated chain partitions of general partially ordered sets. Includes exercises and solutions.

This book comprises a collection of high quality papers in selected topics of Discrete Mathematics, to celebrate the 60th birthday of Professor Jarik Nešetril. Leading experts have contributed survey and research papers in the areas of Algebraic Combinatorics, Combinatorial Number Theory, Game theory, Ramsey Theory, Graphs and Hypergraphs, Homomorphisms, Graph Colorings and Graph Embeddings.

This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. It comprises selected papers from a conference held at the University of Montreal. Topics covered in the articles include association schemes, extremal problems, combinatorial geometrics and matroids, and designs. All the papers contain new results and many are extensive surveys of particular areas of research. Particularly valuable will be Ivanov's paper on recent Soviet research in these areas. Consequently this volume will be of great attraction to all researchers in combinatorics and to research students requiring a rapid introduction to some of the open problems in the subject.