3 of 3 Chapters Published -- Complete!
Part I: Introduction & Core Proof Techniques
Published chapters in this curriculum part, listed in learning order.
Part 1
Chapter 1: Introduction to Combinatorial Thinking
From chessboards and routes to proofs that count
Read Article →Part 2
Chapter 2: Mathematical Induction and Recursive Reasoning
Build infinite families from finite steps and recursive structure
Read Article →Part 3
Chapter 3: Pigeonhole Principle and Introductory Ramsey Theory
When unavoidable repetition forces mathematical structure
Read Article →2 of 2 Chapters Published -- Complete!
Part II: Elementary Counting & Algorithmic Generation
Published chapters in this curriculum part, listed in learning order.
Part 4
Chapter 4: Permutations and Combinations
Count arrangements, allocations, functions, and constrained words
Read Article →Part 5
Chapter 5: Algorithmic Generation of Combinatorial Structures
Generate each object once, then rank, unrank, and sample it
Read Article →3 of 3 Chapters Published -- Complete!
Part III: Binomial Coefficients, Partitions & Advanced Counting
Published chapters in this curriculum part, listed in learning order.
Part 6
Chapter 6: Binomial Coefficients and Identities
See algebraic identities as counts of the same objects
Read Article →Part 7
Chapter 7: Partitions and Structure Types
Organize integers and sets into blocks, diagrams, and restricted families
Read Article →Part 8
Chapter 8: Permutation Structure
Cycles, descents, inversions, and patterns reveal hidden order
Read Article →3 of 3 Chapters Published -- Complete!
Part IV: Advanced Enumerative Techniques
Published chapters in this curriculum part, listed in learning order.
Part 9
Chapter 9: Inclusion-Exclusion and Möbius Inversion
Correct overcounting, then generalize cancellation to ordered sets
Read Article →Part 10
Chapter 10: Generating Functions and Recurrence Relations
Translate recursive structure into algebra and extract exact counts
Read Article →Part 11
Chapter 11: Special Counting Sequences and Lattice Paths
Catalan families, reflection, and determinants count constrained walks
Read Article →3 of 3 Chapters Published -- Complete!
Part V: Selection, Structural & Algebraic Combinatorics
Published chapters in this curriculum part, listed in learning order.
Part 12
Chapter 12: Systems of Distinct Representatives and Matchings
From assignment puzzles to existence theorems and matching polyhedra
Read Article →Part 13
Chapter 13: Combinatorial Designs
Build balanced schedules, block systems, and orthogonal structures
Read Article →Part 14
Chapter 14: Group Actions and Symmetry
Count patterns up to rotation, reflection, and relabeling
Read Article →2 of 2 Chapters Published -- Complete!
Part VI: Graph Theory and Networks
Published chapters in this curriculum part, listed in learning order.
Part 15
Chapter 15: Fundamentals of Graph Theory
The graph structures and counting theorems combinatorics needs
Read Article →Part 16
Chapter 16: Directed Graphs and Network Flows
Convert feasibility, assignments, and connectivity into integral flows
Read Article →2 of 2 Chapters Published -- Complete!
Part VII: Posets, Lattices and Extremal Set Theory
Published chapters in this curriculum part, listed in learning order.
Part 17
Chapter 17: Partially Ordered Sets and Lattice Theory
Chains, antichains, incidence algebras, and order-based enumeration
Read Article →Part 18
Chapter 18: Extremal Set Theory
How large can a family be when intersections are constrained?
Read Article →3 of 3 Chapters Published -- Complete!
Part VIII: Extremal Graph Theory, Hypergraphs and Ramsey Theory
Published chapters in this curriculum part, listed in learning order.
Part 19
Chapter 19: Extremal Graph Theory
Find the most edges compatible with a forbidden pattern
Read Article →Part 20
Chapter 20: Hypergraph Theory
Generalize edges to many-way relationships and new extremal phenomena
Read Article →Part 21
Chapter 21: Ramsey Theory
Unavoidable patterns in graphs, words, and arithmetic configurations
Read Article →3 of 3 Chapters Published -- Complete!
Part IX: Probabilistic Combinatorics and Random Structures
Published chapters in this curriculum part, listed in learning order.
Part 22
Chapter 22: The Probabilistic Method
Use randomness to prove existence and turn it into constructions
Read Article →Part 23
Chapter 23: Random Graphs and Random Combinatorial Structures
Thresholds, branching processes, and the geometry of typical objects
Read Article →Part 24
Chapter 24: Information-Theoretic and Entropy Methods
Bound combinatorial families by measuring information
Read Article →4 of 4 Chapters Published -- Complete!
Part X: Advanced Enumerative and Analytic Combinatorics
Published chapters in this curriculum part, listed in learning order.
Part 25
Chapter 25: Combinatorial Species and Structured Enumeration
Describe labeled and unlabeled objects through their structural grammar
Read Article →Part 26
Chapter 26: Analytic Combinatorics
Read coefficient growth and limiting laws from singularities
Read Article →Part 27
Chapter 27: Advanced Partition Theory and q-Series
From partition bijections to modular identities and asymptotic formulas
Read Article →Part 28
Chapter 28: Bijective, Algebraic and Computer-Assisted Enumeration
Move between involutions, determinants, recurrences, and proof certificates
Read Article →4 of 4 Chapters Published -- Complete!
Part XI: Algebraic Combinatorics and Representation Theory
Published chapters in this curriculum part, listed in learning order.
Part 29
Chapter 29: Symmetric Functions and Young Tableaux
Tableaux connect enumeration, symmetric polynomials, and characters
Read Article →Part 30
Chapter 30: Representation-Theoretic Combinatorics
Model group representations with partitions, tableaux, and Weyl structure
Read Article →Part 31
Chapter 31: Algebraic Graph Theory and Spectral Combinatorics
Use eigenvalues to control connectivity, expansion, and forbidden structure
Read Article →Part 32
Chapter 32: Matroid Theory
A common language for independence, greedy choice, and duality
Read Article →2 of 2 Chapters Published -- Complete!
Part XII: Additive and Arithmetic Combinatorics
Published chapters in this curriculum part, listed in learning order.
Part 33
Chapter 33: Additive Combinatorics
Small sumsets reveal algebraic structure and Fourier regularity
Read Article →Part 34
Chapter 34: Arithmetic Combinatorics and Higher-Order Fourier Analysis
Detect arithmetic patterns through density, uniformity, and higher-order structure
Read Article →3 of 3 Chapters Published -- Complete!
Part XIII: Geometry, Topology and Discrete Structures
Published chapters in this curriculum part, listed in learning order.
Part 35
Chapter 35: Geometric Combinatorics
Convexity, incidences, and geometric configurations as counting problems
Read Article →Part 36
Chapter 36: Polyhedral and Ehrhart Combinatorics
Count lattice points and read discrete structure from polytopes
Read Article →Part 37
Chapter 37: Topological Combinatorics
Use complexes and topology to force discrete configurations
Read Article →3 of 3 Chapters Published -- Complete!
Part XIV: Algorithmic Combinatorics and Discrete Optimization
Published chapters in this curriculum part, listed in learning order.
Part 38
Chapter 38: Combinatorial Algorithms
Exploit states, structure, and transforms to make exact search feasible
Read Article →Part 39
Chapter 39: Combinatorial Optimization
Integrality, duality, and relaxation explain discrete optima
Read Article →Part 40
Chapter 40: Randomized Algorithms and Approximate Counting
Sample large spaces and estimate counts with quantified error
Read Article →2 of 2 Chapters Published -- Complete!
Part XV: Coding Theory, Finite Geometry and Discrete Information
Published chapters in this curriculum part, listed in learning order.
Part 41
Chapter 41: Coding Theory and Combinatorial Designs
Turn separation in discrete spaces into reliable information
Read Article →Part 42
Chapter 42: Finite Geometry and Finite-Field Combinatorics
Count subspaces and study incidence structures over finite fields
Read Article →2 of 2 Chapters Published -- Complete!
Part XVI: Advanced Algebraic and Polynomial Methods
Published chapters in this curriculum part, listed in learning order.
Part 43
Chapter 43: The Polynomial Method
Encode discrete constraints algebraically to obtain sharp bounds
Read Article →Part 44
Chapter 44: Advanced Algebraic Combinatorics
Positivity, Hopf structure, geometry, and Hodge-theoretic phenomena
Read Article →3 of 3 Chapters Published -- Complete!
Part XVII: Advanced Extremal and Probabilistic Research
Published chapters in this curriculum part, listed in learning order.
Part 45
Chapter 45: Modern Extremal Combinatorics
Transfer dense theorems to sparse settings and enumerate constrained families
Read Article →Part 46
Chapter 46: Pseudorandomness and Expander Structures
Construct deterministic structures with random-like combinatorial behavior
Read Article →Part 47
Chapter 47: Graph Limits and Asymptotic Structures
Study convergent graph sequences and certify extremal density bounds
Read Article →3 of 3 Chapters Published -- Complete!
Part XVIII: Combinatorics and Theoretical Computer Science
Published chapters in this curriculum part, listed in learning order.
Part 48
Chapter 48: Complexity of Counting and Enumeration
Classify when exact and approximate counts can be computed efficiently
Read Article →Part 49
Chapter 49: Combinatorics in Algorithms, Learning and Optimization
Connect set-system dimensions and discrete structure to computational learning
Read Article →Part 50
Chapter 50: Combinatorial Game Theory and Discrete Dynamics
Analyze games and local moves using values, invariants, and structure
Read Article →3 of 3 Chapters Published -- Complete!
Part XIX: Emerging and Specialized Research Directions
Published chapters in this curriculum part, listed in learning order.
Part 51
Chapter 51: Discrete Probability and Statistical Mechanics
Partition functions link counting, dynamics, and phase transitions
Read Article →Part 52
Chapter 52: Combinatorial Discrepancy and Geometric Functional Methods
Balance set systems with probabilistic, entropy, and geometric tools
Read Article →Part 53
Chapter 53: Research Topics in Combinatorial Structures
Specialize in enumeration, random structures, and algebraic connections
Read Article →3 of 3 Chapters Published -- Complete!
Part XX: Research Methodology and Open Problems
Published chapters in this curriculum part, listed in learning order.
Part 54
Chapter 54: Experimental and Computational Combinatorics
Make computational evidence reproducible and mathematically accountable
Read Article →Part 55
Chapter 55: Reading, Developing and Publishing Research
Move from understanding a paper to producing a defensible mathematical result
Read Article →Part 56
Chapter 56: Research Seminars and Open-Problem Studios
Choose a specialization and investigate a verified current problem
Read Article →4 of 4 Capstones Published -- Complete!
Capstone Projects
Four investigations combining mathematical reasoning with reproducible computation.
Capstone
Capstone A: The Counting Laboratory
Unify exact counts, generating functions, bijections, and asymptotic estimates
Read Article →Capstone
Capstone B: Extremal Graph Discovery
Enumerate small graphs and turn forbidden-pattern experiments into conjectures
Read Article →Capstone
Capstone C: Algebraic Combinatorics Explorer
Implement tableaux, RSK, hook-length counts, and symbolic identity experiments
Read Article →Capstone
Capstone D: Random Structures Laboratory
Compare simulated thresholds and phase transitions with rigorous probability estimates
Read Article →