Enumerative Combinatorics

Charalambos A. Charalambides

$231

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Chapman & Hall/CRC
29 May 2002

Probability & statistics; Combinatorics & graph theory

Series: Discrete Mathematics and Its Applications

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.

By: Charalambos A. Charalambides
Imprint: Chapman & Hall/CRC
Country of Publication: United States
Dimensions: Height: 234mm, Width: 156mm, Spine: 39mm
Weight: 1.330kg
ISBN: 9781584882909
ISBN 10: 1584882905
Series: Discrete Mathematics and Its Applications
Pages: 632
Publication Date: 29 May 2002
Audience: College/higher education , General/trade , Professional & Vocational , Primary , ELT Advanced
Format: Hardback
Publisher's Status: Active

Basic Counting Principles. Permutations and Combinations. Factorials, Binomial and Multinomial Coefficients. The Principle of Inclusion and Exclusion.Permutations with Fixed Points and Successions. Generating Functions. Recurrence Relations. Stirling Numbers. Distributions and Occupancy. Partitions of Integers. Partition Polynomials. Cycles of Permutations. Equivalence Classes.Runs of Permutations and Eulerian Numbers. Hints and Answers to Exercises. Bibliography. Index.

Charalambides, Charalambos A.

Reviews for Enumerative Combinatorics

"""The broad field of applications of combinatorial methods makes this book useful to anyone interested in operations research, physical, or social sciences. Provides a comprehensive coverage of enumerative combinatorics, and gives many illuminating examples and interesting historical notes students of combinatorics will find the book very useful as there are many theorems, all with complete proofs, and many exercises with hints and answers."" -Journal of the Operational Research Society, Vol 55, no. 2, 2004"