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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
I. M. Gessel, G. Viennot: Binomial determinants, paths, and hook length formulae. Advances in Math. 58 (1985), 300–321.
B. Lindström: On the vector representation of induced matroids. Bull. London Math. Soc. 5 (1973), 85–90.
P. A. Mac Mahon: Combinatory Analysis, Vol. 2. Chelsea 1960.
R. P. Stanley: Enumerative Combinatorics, Vol. 2. Cambridge Univ. Press 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M. (2001). Lattice Paths and Determinants. In: Alt, H. (eds) Computational Discrete Mathematics. Lecture Notes in Computer Science, vol 2122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45506-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-45506-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42775-9
Online ISBN: 978-3-540-45506-6
eBook Packages: Springer Book Archive