Enumerative Combinatorics: Volume 1
Seiten
2000
Cambridge University Press (Verlag)
978-0-521-66351-9 (ISBN)
Cambridge University Press (Verlag)
978-0-521-66351-9 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Enumerative combinatorics deals with the basic problem of counting how many objects have a given property, a subject of great applicability. This book provides an introduction at a level suitable for graduate students. Extensive exercises with solutions show connections to other areas of mathematics.
This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.
1. What is enumerative combinatorics?; 2. Sieve methods; 3. Partially ordered sets; 4. Rational generating functions.
Erscheint lt. Verlag | 28.2.2000 |
---|---|
Reihe/Serie | Cambridge Studies in Advanced Mathematics |
Vorwort | Gian-Carlo Rota |
Zusatzinfo | 131 Line drawings, unspecified |
Verlagsort | Cambridge |
Sprache | englisch |
Maße | 154 x 229 mm |
Gewicht | 470 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
ISBN-10 | 0-521-66351-2 / 0521663512 |
ISBN-13 | 978-0-521-66351-9 / 9780521663519 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices
Buch | Softcover (2023)
De Gruyter (Verlag)
64,95 €