CMS Treatises in Mathematics is a new series of books: a collection of short monographs, dedicated to well defined subjects of current interest. These treatises emphasize the interdisciplinary character of the mathematical sciences and facilitate integration of methods and results from different areas of current research. Each book will deal with a current topic and will be written for students and non-specialists, allowing them to enter a new subject and move on to the more advanced literature.

Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the most important current research in the field, this book provides an intensive, yet accessible, introduction to the subject of algebraic combinatorics. After recalling basic notions of combinatorics, representation theory, and some commutative algebra, the main material provides links between the study of coinvariant—or diagonally coinvariant—spaces and the study of Macdonald polynomials and related operators. This gives rise to a large number of combinatorial questions relating to objects counted by familiar numbers such as the factorials, Catalan numbers, and the number of Cayley trees or parking functions. The author offers ideas for extending the theory to other families of finite Coxeter groups, besides permutation groups.

The concept of factorization, familiar in the ordinary system of whole numbers that can be written as a unique product of prime numbers, plays a central role in modern mathematics and its applications. This exposition of the classic theory leads the reader to an understanding of the current knowledge of the subject and its connections to other mathematical concepts, for example in algebraic number theory. The book can be used as a text for a first course in number theory or for self-study by motivated high school students or readers interested in modern mathematics.

Every mathematician, and user of mathematics, needs to manipulate sums or to find and handle combinatorial identities. In this book, the author provides a coherent tour of many known finite algebraic sums and offers a guide for devising simple ways of changing a given sum to a standard form that can be evaluated . As such, Summa Summarum serves as both an introduction and a reference for researchers, graduate and upper-level undergraduate students, and non-specialists alike: from tools as distinct as the most classical ideas of Euler to the recent effective computer algorithms by Gosper and Wilf-Zeilberger. The book is self-contained with relatively few prerequisites and so should be accessible to a very broad readership.