Combinatorial Reciprocity Theorems


Book Description

Combinatorial reciprocity is a very interesting phenomenon, which can be described as follows: A polynomial, whose values at positive integers count combinatorial objects of some sort, may give the number of combinatorial objects of a different sort when evaluated at negative integers (and suitably normalized). Such combinatorial reciprocity theorems occur in connections with graphs, partially ordered sets, polyhedra, and more. Using the combinatorial reciprocity theorems as a leitmotif, this book unfolds central ideas and techniques in enumerative and geometric combinatorics. Written in a friendly writing style, this is an accessible graduate textbook with almost 300 exercises, numerous illustrations, and pointers to the research literature. Topics include concise introductions to partially ordered sets, polyhedral geometry, and rational generating functions, followed by highly original chapters on subdivisions, geometric realizations of partially ordered sets, and hyperplane arrangements.







Combinatorics and Commutative Algebra


Book Description

* Stanley represents a broad perspective with respect to two significant topics from Combinatorial Commutative Algebra: 1) The theory of invariants of a torus acting linearly on a polynomial ring, and 2) The face ring of a simplicial complex * In this new edition, the author further develops some interesting properties of face rings with application to combinatorics




Combinatorics


Book Description

Combinatorics has come of age. It had its beginnings in a number of puzzles which have still not lost their charm. Among these are EULER'S problem of the 36 officers and the KONIGSBERG bridge problem, BACHET's problem of the weights, and the Reverend T.P. KIRKMAN'S problem of the schoolgirls. Many of the topics treated in ROUSE BALL'S Recreational Mathe matics belong to combinatorial theory. All of this has now changed. The solution of the puzzles has led to a large and sophisticated theory with many complex ramifications. And it seems probable that the four color problem will only be solved in terms of as yet undiscovered deep results in graph theory. Combinatorics and the theory of numbers have much in common. In both theories there are many prob lems which are easy to state in terms understandable by the layman, but whose solution depends on complicated and abstruse methods. And there are now interconnections between these theories in terms of which each enriches the other. Combinatorics includes a diversity of topics which do however have interrelations in superficially unexpected ways. The instructional lectures included in these proceedings have been divided into six major areas: 1. Theory of designs; 2. Graph theory; 3. Combinatorial group theory; 4. Finite geometry; 5. Foundations, partitions and combinatorial geometry; 6. Coding theory. They are designed to give an overview of the classical foundations of the subjects treated and also some indication of the present frontiers of research.




Algebraic And Geometric Combinatorics On Lattice Polytopes - Proceedings Of The Summer Workshop On Lattice Polytopes


Book Description

This volume consists of research papers and expository survey articles presented by the invited speakers of the Summer Workshop on Lattice Polytopes. Topics include enumerative, algebraic and geometric combinatorics on lattice polytopes, topological combinatorics, commutative algebra and toric varieties.Readers will find that this volume showcases current trends on lattice polytopes and stimulates further developments of many research areas surrounding this field. With the survey articles, research papers and open problems, this volume provides its fundamental materials for graduate students to learn and researchers to find exciting activities and avenues for further exploration on lattice polytopes.




Computer Algebra and Polynomials


Book Description

Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life. This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects. The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.




Combinatorial Theory


Book Description

This book offers a well-organized, easy-to-follow introduction to combinatorial theory, with examples, notes and exercises. ". . . a very good introduction to combinatorics. This book can warmly be recommended first of all to students interested in combinatorics." Publicationes Mathematicae Debrecen




Selected Works of Richard P. Stanley


Book Description

Richard Stanley's work in combinatorics revolutionized and reshaped the subject. Many of his hallmark ideas and techniques imported from other areas of mathematics have become mainstays in the framework of modern combinatorics. In addition to collecting several of Stanley's most influential papers, this volume also includes his own short reminiscences on his early years, and on his celebrated proof of The Upper Bound Theorem.




Open Problems in Algebraic Combinatorics


Book Description

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.




Enumerative Combinatorics: Volume 1


Book Description

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets.