| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1148143 | Journal of Statistical Planning and Inference | 2010 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jennifer J. Quinn,