Enumerative Combinatorics

1st Edition

Charalambos A. Charalambides

Chapman and Hall/CRC
Published May 29, 2002
Textbook - 632 Pages - 14 B/W Illustrations
ISBN 9781584882909 - CAT# C2905
Series: Discrete Mathematics and Its Applications

For Instructors Request Inspection Copy

was $115.00

USD$92.00

SAVE ~$23.00

Add to Wish List
FREE Standard Shipping!

Summary

Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary background, including basic counting principles and techniques, elementary enumerative topics, and an extended presentation of generating functions and recurrence relations. The remaining seven chapters focus on more advanced topics, including, Stirling numbers, partitions of integers, partition polynomials, Eulerian numbers and Polya's counting theorem.

Extensively classroom tested, this text was designed for introductory- and intermediate-level courses in enumerative combinatorics, but the far-reaching applications of the subject also make the book useful to those in operational research, the physical and social science, and anyone who uses combinatorial methods. Remarks, discussions, tables, and numerous examples support the text, and a wealth of exercises-with hints and answers provided in an appendix--further illustrate the subject's concepts, theorems, and applications.

Instructors

We provide complimentary e-inspection copies of primary textbooks to instructors considering our books for course adoption.

Request an
e-inspection copy

Share this Title