Skip to main content

Lattice paths and determinants

  • Chapter
  • 718 Accesses

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 BurnsideFrobenius Lemma in combinatorics.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. M. Gessel & G. Viennot: Binomial determinants, paths, and hook length formulae, Advances in Math. 58 (1985), 300–321.

    Article  MathSciNet  MATH  Google Scholar 

  2. B. Lindström: On the vector representation of induced matroids, Bulletin London Math. Soc. 5 (1973), 85–90.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aigner, M., Ziegler, G.M. (2004). Lattice paths and determinants. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05412-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05412-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-05414-7

  • Online ISBN: 978-3-662-05412-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics