Kategoria BISAC: Mathematics >> Combinatorics

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new...

In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of "abstract" graph theory are often incapable of providing satisfactory answers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoning field with many striking results and appealing open questions.

This contributed volume contains thirty original survey and research...

The Abel Symposium 2009 "Combinatorial aspects of Commutative Algebra and Algebraic Geometry," held at Voss, Norway, featured talks by leading researchers in the field.

This is the proceedings of the Symposium, presenting contributions on syzygies, tropical geometry, Boij-Soderberg theory, Schubert calculus, and quiver varieties. The volume also includes an introductory survey on binomial ideals with applications to hypergeometric series, combinatorial games and chemical reactions.

The contributions pose interesting problems, and offer up-to-date research on...

Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities of set partitions from 1500 A.D. to today.

Each chapter gives historical perspectives and contrasts different approaches, including generating functions, kernel method, block decomposition method, generating tree,...