Titti Westlin: Bevis av Lindström–Gessel–Viennots lemma samt några tillämpningar

Abstract

We prove Lindström–Gessel–Viennot's lemma. This lemma provides a method to count numbers of non-intersecting n-tuples of paths in a graph via a determinant. The result has many practical applications, particularly in combinatorics regarding Young tableaux.