Enumerative Combinatorics
eBook - PDF

Enumerative Combinatorics

  1. 632 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Enumerative Combinatorics

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Enumerative Combinatorics by Charalambos A. Charalambides in PDF and/or ePUB format, as well as other popular books in Business & Operations. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Chapman and Hall/CRC
Year
2018
Print ISBN
9780367396121
eBook ISBN
9781482296310
Edition
1
Topic
Business
Subtopic
Operations
Index
Business

Table of contents

  1. Cover
  2. Half Title
  3. Title Page
  4. Copyright Page
  5. Preface
  6. Dedication
  7. Contents
  8. 1 BASIC COUNTING PRINCIPLES
  9. 2 PERMUTATIONS AND COMBINATIONS
  10. 3 FACTORIALS, BINOMIAL AND MULTINOMIAL CO-EFFICIENTS
  11. 4 THE PRINCIPLE OF INCLUSION AND EXCLUSION
  12. 5 PERMUTATIONS WITH FIXED POINTS AND SUCCESSIONS
  13. 6 GENERATING FUNCTIONS
  14. 7 RECURRENCE RELATIONS
  15. 8 STIRLING NUMBERS
  16. 9 DISTRIBUTIONS AND OCCUPANCY
  17. 10 PARTITIONS OF INTEGERS
  18. 11 PARTITION POLYNOMIALS
  19. 12 CYCLES OF PERMUTATIONS
  20. 13 EQUIVALENCE CLASSES
  21. 14 RUNS OF PERMUTATIONS AND EULERIAN NUMBERS
  22. HINTS AND ANSWERS TO EXERCISES
  23. BIBLIOGRAPHY
  24. INDEX