Lattice paths and determinants

Authors:
Martin Aigner
Affiliations:
Free Univ. of Berlin, Berlin, Germany
Venue:
Computational Discrete Mathematics
Year:
2001

Citing 1
Cited 2

Enumerative combinatorics

Enumerative combinatorics

Division-free algorithms for the determinant and the Pfaffian: algebraic and combinatorial approaches

Computational Discrete Mathematics
Laurent biorthogonal polynomials, q-Narayana polynomials and domino tilings of the Aztec diamonds

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we look at one such marvelous piece of mathematical reasoning, the Lemma of Gessel and Viennot which has become an instant classic in combinatorial enumeration since its appearance in 1985. A similar version which was largely overlooked was previously obtained by Lindström.