This book is based on two series of lectures given at a summer school on algebraic combinatorics at the Sophus Lie Centre in Nordfjordeid, Norway, in June 2003, one by Peter Orlik on hyperplane arrangements, and the other one by Volkmar Welker on free resolutions. Both topics are essential parts of current research in a variety of mathematical fields, and the present book makes these sophisticated tools available for graduate students.

This graduate level text is distinguished both by the range of topics and the novelty of the material it treats--more than half of the material in it has previously only appeared in research papers. The first half of this book introduces the characteristic and matchings polynomials of a graph. It is instructive to consider these polynomials together because they have a number of properties in common. The matchings polynomial has links with a number of problems in combinatorial enumeration, particularly some of the current work on the combinatorics of orthogonal polynomials. This connection is discussed at some length, and is also in part the stimulus for the inclusion of chapters on orthogonal polynomials and formal power series. Many of the properties of orthogonal polynomials are derived from properties of characteristic polynomials. The second half of the book introduces the theory of polynomial spaces, which provide easy access to a number of important results in design theory, coding theory and the theory of association schemes. This book should be of interest to second year graduate text/reference in mathematics.

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdős–Moser conjecture, electrical networks, the Sperner property, shellability of simplicial complexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees. The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added. From reviews of the first edition: “This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics ... . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. ... Summing Up: Highly recommended. Upper-division undergraduates and above.” —D. V. Feldman, Choice, Vol. 51(8), April, 2014

Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups. In the spirit of Delsarte's theory, this book studies combinatorial objects such as graphs, codes, designs, etc. in the general framework of association schemes, providing a comprehensive overview of the theory as well as pointing out to extensions.

In their preface, the editors describe algebraic combinatorics as the area of combinatorics concerned with exact, as opposed to approximate, results and which puts emphasis on interaction with other areas of mathematics, such as algebra, topology, geometry, and physics. It is a vibrant area, which saw several major developments in recent years. The goal of the 2022 conference Open Problems in Algebraic Combinatorics 2022 was to provide a forum for exchanging promising new directions and ideas. The current volume includes contributions coming from the talks at the conference, as well as a few other contributions written specifically for this volume. The articles cover the majority of topics in algebraic combinatorics with the aim of presenting recent important research results and also important open problems and conjectures encountered in this research. The editors hope that this book will facilitate the exchange of ideas in algebraic combinatorics.

Because of the inteplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction and will be of interest to researchers in discrete mathematics and combinatorial systems.

Because of the interplay among many fields of mathematics and science, algebraic combinatorics is an area in which a wide variety of ideas and methods come together. The papers in this volume reflect the most interesting aspects of this rich interaction, and will be of interest to researchers in discrete mathematics and combinatorial systems.

Covering, arguably, one of the most attractive and mysterious mathematical objects, the Monster group, this text strives to provide an insightful introduction and the discusses the current state of the field. The Monster group is related to many areas of mathematics, as well as physics, from number theory to string theory. This book cuts through the complex nature of the field, highlighting some of the mysteries and intricate relationships involved. Containing many meaningful examples and a manual introduction to the computer package GAP, it provides the opportunity and resources for readers to start their own calculations. Some 20 experts here share their expertise spanning this exciting field, and the resulting volume is ideal for researchers and graduate students working in Combinatorial Algebra, Group theory and related areas.

This edited volume features a curated selection of research in algebraic combinatorics that explores the boundaries of current knowledge in the field. Focusing on topics experiencing broad interest and rapid growth, invited contributors offer survey articles on representation theory, symmetric functions, invariant theory, and the combinatorics of Young tableaux. The volume also addresses subjects at the intersection of algebra, combinatorics, and geometry, including the study of polytopes, lattice points, hyperplane arrangements, crystal graphs, and Grassmannians. All surveys are written at an introductory level that emphasizes recent developments and open problems. An interactive tutorial on Schubert Calculus emphasizes the geometric and topological aspects of the topic and is suitable for combinatorialists as well as geometrically minded researchers seeking to gain familiarity with relevant combinatorial tools. Featured authors include prominent women in the field known for their exceptional writing of deep mathematics in an accessible manner. Each article in this volume was reviewed independently by two referees. The volume is suitable for graduate students and researchers interested in algebraic combinatorics.

Proceedings of a high-level conference on discrete mathematics, focusing on group actions in the areas of pure mathematics, applied mathematics, computer science, physics, and chemistry. A useful tool for researchers and graduate students in discrete mathematics and theoretical computer science.