Amazon cover image
Image from Amazon.com
Image from Google Jackets

Enumerative combinatorics

By: Material type: TextTextLanguage: English Series: Discrete mathematics and its applications | The CRC Ptress seriesPublication details: USA Chapman & Hall/CRC 2002Description: xvi, 609p. illISBN:
  • 1584882905 (HB)
Subject(s):
Contents:
1. Basic Counting Principles 2. Permutations and Combinations 3. Factorials, Binomial and Multinomial Coefficients 4. The Principle of Inclusion and Exclusion 5. Permutations with Fixed Points and Successions 6. Generating Functions 7. Recurrence Relations 8. Stirling Numbers 9. Distributions and Occupancy 10. Partitions of Integers 11. Partition Polynomials 12. Cycles of Permutations 13. Equivalence Classes 14. Runs of Permutations and Eulerian Numbers
Summary: Enumerative Combinatorics provides systematic coverage of the theory of enumeration. The author first lays a foundation with basic counting principles and techniques and elementary classical enumerative topics, then proceeds to more advanced topics, including the partition polynomials, Stirling numbers, and the Eulerian numbers of generalized binomials. The text is supported by remarks and discussions, numerous tables, exercises, and a wealth of examples that illustrate the concepts, theorems, and applications of the subject.
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 519.11 CHA (Browse shelf(Opens below)) Available 48863

Includes index

Includes bibliography (p. 591-600)

1. Basic Counting Principles
2. Permutations and Combinations
3. Factorials, Binomial and Multinomial Coefficients
4. The Principle of Inclusion and Exclusion
5. Permutations with Fixed Points and Successions
6. Generating Functions
7. Recurrence Relations
8. Stirling Numbers
9. Distributions and Occupancy
10. Partitions of Integers
11. Partition Polynomials
12. Cycles of Permutations
13. Equivalence Classes
14. Runs of Permutations and Eulerian Numbers

Enumerative Combinatorics provides systematic coverage of the theory of enumeration. The author first lays a foundation with basic counting principles and techniques and elementary classical enumerative topics, then proceeds to more advanced topics, including the partition polynomials, Stirling numbers, and the Eulerian numbers of generalized binomials. The text is supported by remarks and discussions, numerous tables, exercises, and a wealth of examples that illustrate the concepts, theorems, and applications of the subject.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India