Abstract
The first interesting array of numbers a typical mathematics student encounters is Pascal’s triangle, shown in Table 1.1. It has many beautiful properties, some of which we will review shortly. One of the main points of this chapter is to argue that the array of Eulerian numbers is just as interesting as Pascal’s triangle.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Carlitz L. q-Bernoulli and Eulerian numbers. Trans Am Math Soc. 1954;76:332–50.
Carlitz L. Eulerian numbers and polynomials. Math Mag. 1958/1959;32:247–60.
Carlitz L. A combinatorial property of q-Eulerian numbers. Am Math Monthly. 1975;82:51–4.
Carlitz L, Kurtz DC, Scoville R, Stackelberg OP. Asymptotic properties of Eulerian numbers. Z Wahrscheinlichkeitstheorie und Verw Gebiete. 1972;23:47–54.
Carlitz L, Roselle DP, Scoville RA. Permutations and sequences with repetitions by number of increases. J Combinatorial Theory. 1966;1:350–74.
Carlitz L, Scoville R. Generalized Eulerian numbers: combinatorial applications. J Reine Angew Math. 1974;265:110–37.
Euler LP. Institutiones calculi differentialis cum eius usu in analysi finitorum ac doctrina serierum. Ticini: in typographeo Petri Galeatii; 1787.
Flajolet P, Sedgewick R. Analytic combinatorics. Cambridge University Press, Cambridge; 2009.
Foata D. Eulerian polynomials: from Euler’s time to the present. In: The legacy of Alladi Ramakrishnan in the mathematical sciences. Springer, New York; 2010. p. 253–73. Available from: http://dx.doi.org/10.1007/978-1-4419-6263-815.
Foata D, Schützenberger MP. Théorie géométrique des polynômes eulériens. Lecture Notes in Mathematics, Vol. 138. Springer-Verlag, Berlin-New York; 1970.
Knuth DE. The art of computer programming. Vol. 3. Addison-Wesley, Reading, MA; 1998. Sorting and searching, Second edition [of MR0445948].
MacMahon PA. Combinatory analysis. Two volumes (bound as one). Chelsea Publishing Co., New York; 1960.
Riordan J. An introduction to combinatorial analysis. Dover Publications, Inc., Mineola, NY; 2002. Reprint of the 1958 original.
Stanley RP. Enumerative combinatorics. Volume 1. vol. 49 of Cambridge Studies in Advanced Mathematics. 2nd ed. Cambridge University Press, Cambridge; 2012.
Wilf HS. generatingfunctionology. 3rd ed. A K Peters, Ltd., Wellesley, MA; 2006.
Worpitzky J. Studien über die Bernoullischen und Eulerischen Zahlen. J Reine Angew Math 94, 203–32, 1883. 1883;94:202–32.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this chapter
Cite this chapter
Petersen, T.K. (2015). Eulerian numbers. In: Eulerian Numbers. Birkhäuser Advanced Texts Basler Lehrbücher. Birkhäuser, New York, NY. https://doi.org/10.1007/978-1-4939-3091-3_1
Download citation
DOI: https://doi.org/10.1007/978-1-4939-3091-3_1
Publisher Name: Birkhäuser, New York, NY
Print ISBN: 978-1-4939-3090-6
Online ISBN: 978-1-4939-3091-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)