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.

This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...

This volume contains the proceedings of the AMS Special Session on Discrete Geometry and Algebraic Combinatorics held on January 11, 2013, in San Diego, California. The collection of articles in this volume is devoted to packings of metric spaces and related questions, and contains new results as well as surveys of some areas of discrete geometry. This volume consists of papers on combinatorics of transportation polytopes, including results on the diameter of graphs of such polytopes; the generalized Steiner problem and related topics of the minimal fillings theory; a survey of distance graphs and graphs of diameters, and a group of papers on applications of algebraic combinatorics to packings of metric spaces including sphere packings and topics in coding theory. In particular, this volume presents a new approach to duality in sphere packing based on the Poisson summation formula, applications of semidefinite programming to spherical codes and equiangular lines, new results in list decoding of a family of algebraic codes, and constructions of bent and semi-bent functions.

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.

This book contains twenty-two papers presented at the International Conference in Combinatorics, held in Jerusalem in May 1993. The papers describe some of the latest developments in algebraic combinatorics, enumeration, graph and hypergraph theory, combinatorial geometry, and geometry of polytopes and arrangements. The papers are accessible to specialists as well as nonspecialists.

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

This book gathers research papers and surveys on the latest advances in Schubert Calculus, presented at the International Festival in Schubert Calculus, held in Guangzhou, China on November 6–10, 2017. With roots in enumerative geometry and Hilbert's 15th problem, modern Schubert Calculus studies classical and quantum intersection rings on spaces with symmetries, such as flag manifolds. The presence of symmetries leads to particularly rich structures, and it connects Schubert Calculus to many branches of mathematics, including algebraic geometry, combinatorics, representation theory, and theoretical physics. For instance, the study of the quantum cohomology ring of a Grassmann manifold combines all these areas in an organic way. The book is useful for researchers and graduate students interested in Schubert Calculus, and more generally in the study of flag manifolds in relation to algebraic geometry, combinatorics, representation theory and mathematical physics.

This book reproduces the doctoral thesis written by a remarkable mathematician, Sergei V. Kerov. His untimely death at age 54 left the mathematical community with an extensive body of work and this one-of-a-kind monograph. Here, he gives a clear and lucid account of results and methods of asymptotic representation theory. The book is a unique source of information on an important topic of current research. Asymptotic representation theory of symmetric groups deals with problems of two types: asymptotic properties of representations of symmetric groups of large order and representations of the limiting object, i.e., the infinite symmetric group. The author contributed significantly in the development of both directions. His book presents an account of these contributions, as well as those of other researchers. Among the problems of the first type, the author discusses the properties of the distribution of the normalized cycle length in a random permutation and the limiting shape of a random (with respect to the Plancherel measure) Young diagram. He also studies stochastic properties of the deviations of random diagrams from the limiting curve. Among the problems of the second type, Kerov studies an important problem of computing irreducible characters of the infinite symmetric group. This leads to the study of a continuous analog of the notion of Young diagram, and in particular, to a continuous analogue of the hook walk algorithm, which is well known in the combinatorics of finite Young diagrams. In turn, this construction provides a completely new description of the relation between the classical moment problems of Hausdorff and Markov. The book is suitable for graduate students and research mathematicians interested in representation theory and combinatorics.

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.