Abstract
We use the Lindström–Gessel–Viennot Theorem to count nonintersecting lattice paths in a carefully chosen acyclic weighted digraph to give a visual combinatorial proof of Vandermonde's classic determinant.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have