|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Nicholas Loehr (Virginia Technical University, Blacksburg, USA)Publisher: Taylor & Francis Ltd Imprint: Chapman & Hall/CRC Edition: 2nd edition Weight: 1.075kg ISBN: 9781032476711ISBN 10: 1032476710 Pages: 642 Publication Date: 21 January 2023 Audience: College/higher education , General/trade , Tertiary & Higher Education , General Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsPART 1: ENUMERATION. Chapter 1: Basic Counting; Chapter 2: Combinatorial Identities and Recursions; Chapter 3: Counting Problems in Graph Theory; Chapter 4: Inclusion-Exclusion and Related Techniques; New Chapter 5: Generating Functions; Chapter 6: Ranking, Unranking, and Successor Algorithms; PART 2: ALGEBRAIC COMBINATORICS; Chapter 7: Permutation Statistics and q-Analogues; Chapter 8: Permutations and Group Actions; Chapter 9: Tableaux and Symmetric Polynomials. Chapter 10: Abaci and Antisymmetric Polynomials; Chapter 11: Additional Topics. New Appendix: Background in Abstract Algebra.ReviewsAuthor InformationNicholas Loehr is an associate professor of mathematics at Virginia Technical University. Tab Content 6Author Website:Countries AvailableAll regions |