Nicholas Loehr

Combinatorics (eBook, ePUB)

• Format: ePub

Produktbeschreibung

Bijective proofs are some of the most elegant and powerful techniques in all of mathematics. Suitable for readers without prior background in algebra or combinatorics, the book presents an introduction to enumerative and algebraic combinatorics emphasizing bijective methods.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 642
• Erscheinungstermin: 10. August 2017
• Englisch
• ISBN-13: 9781498780278
• Artikelnr.: 55277150

Autorenporträt

Nicholas Loehr is an associate professor of mathematics at Virginia Technical University.

Inhaltsangabe

PART 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.