A01=Charalambos A. Charalambides
Ascending Runs
Author_Charalambos A. Charalambides
Balls F1
Binomial Formula
Category=PBT
Circular Permutations
Cycle Indicator
Cyclic Group
Distinguishable Balls
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Euler's Function
Eulerian Numbers
Eulerian Polynomial
Indices F1
Indistinguishable Balls
Left Coset
Magic Squares
Nite Set
Nonnegative Integer Solution
Odd Permutations
Pairwise Disjoint
Positive Integers
Recurrence Relation
Round Table
Round Table Conference
Set F1
Stirling Number
Vice Versa
Product details
- ISBN 9780367396121
- Weight: 861g
- Dimensions: 156 x 234mm
- Publication Date: 05 Sep 2019
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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.
Charalambides, Charalambos A.
