Uploaded September 2025 | Updated September 2026, 2 weeks ago

---

This video walks through various path counting scenarios including the basic paths on a grid, Catalan Numbers, and culminates to an explanation of the Lindstrom-Gessel-Viennot (LGV) Lemma, a fundamental result in algebraic combinatorics for counting non-intersecting paths on a directed acyclic graph (DAG). The video is self-contained and requires no prior knowledge of advanced combinatorics.

Chapters:
0:33 - Chapter 1: The First March
2:05 - Chapter 2: The Battlefield Sinkhole
3:24 - Chapter 3: The Forbidden Zone
7:15 - Chapter 4: The War

-------------------------------------------------------------------------------------------------------------
#maths #combinatorics #catalan #algebraiccombinatorics #SoME4