Generatingfunctionology
Herbert S. Wilf
A classic and highly readable introduction to generating functions and their uses across discrete mathematics. It shows how these tools bridge counting problems and continuous analysis.
Loading the book...
Keep reading
-
Next in this topic
Topics in Algebraic CombinatoricsAn elegant introduction to algebraic combinatorics through walks in graphs, the Sperner property, Young diagrams, q-binomial coefficients, and the Matrix Tree Theorem. Each chapter is a self contained gem.
Verified PDF · Secure download - An Introduction to Algebraic Combinatorics
A rigorous graduate introduction that starts from formal power series and builds through integer partitions, permutations, and symmetric polynomials to the Littlewood Richardson rule. Includes over 200 exercises.
Verified PDF · Secure download - Introduction to Combinatorics
Lecture notes organized around problem solving, covering the pigeonhole principle, Ramsey theory, and the principle of extremals with many solved and practice problems. A concise bridge toward competition style combinatorics.
Verified PDF · Secure download - Combinatorics
An upper-level introduction that moves from enumeration into graph theory and design theory. Its clear structure and worked examples make it a strong single reference for a full combinatorics course.
Verified PDF · Secure download - Counting Rocks! An Introduction to Combinatorics
A modern undergraduate introduction that pairs each chapter with linked videos and guided investigations. It covers counting problems, proof techniques, recurrences, generating functions, and graph theory.
Verified PDF · Secure download