Visualizing Vandermonde's determinant through nonintersecting lattice paths
Authors:
Jennifer J. Quinn
Affiliation:
Interdisciplinary Arts and Sciences, University of Washington, Tacoma, 1900 Commerce Street, Box 358436, Tacoma, WA 98402-3100, USA
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.