Title

Visualizing Vandermonde's Determinant through Nonintersecting Lattice Paths

Publication Date

8-1-2010

Document Type

Article

Abstract

We use the Lindstrom-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.

Publication Title

Journal Of Statistical Planning And Inference

Volume

140

Issue

8

First Page

2346

Last Page

2350

DOI

10.1016/j.jspi.2010.01.029

Version

pre-print, post-print

This document is currently not available here.

Find in your library

Share

COinS