Lattice paths and determinants
The essence of mathematics is proving theorems — and so, that is what mathematicians do: they prove theorems. But to tell the truth, what they really want to prove, once in their lifetime, is a Lemma, like the one by Fatou in analysis, the Lemma of Gauss in number theory, or the Burnside-Frobenius Lemma in combinatorics.
KeywordsBipartite Graph Acyclic Directed Graph Lattice Path Minimal Index Hook Length
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
I. M. Gessel
& G. Viennot
: Binomial determinants
, paths, and hook leng, formulae, Advances in Math. 58
(1985), 300–321.MathSciNetMATHCrossRefGoogle Scholar
: On the vector representation of induced matroids
, Bullet London Math. Soc. 5
(1973), 85–90.CrossRefGoogle Scholar
© Springer-Verlag Berlin Heidelberg 2001