Advertisement

Lattice paths and determinants

  • Martin Aigner
  • Günter M. Ziegler

Abstract

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.

Keywords

Bipartite 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    I. M. Gessel & G. Viennot: Binomial determinants, paths, and hook leng, formulae, Advances in Math. 58 (1985), 300–321.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    B. Lindstrőm: On the vector representation of induced matroids, Bullet London Math. Soc. 5 (1973), 85–90.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Martin Aigner
    • 1
  • Günter M. Ziegler
    • 2
  1. 1.Institut für Mathematik II (WE2)Freie Universität BerlinBerlinGermany
  2. 2.Institut für Mathematik, MA 6-2Technische Universität BerlinBerlinGermany

Personalised recommendations