pith. sign in

arxiv: math/0508232 · v1 · submitted 2005-08-15 · 🧮 math.CO

Th\'eorie G\'eom\'etrique des Polyn\^omes Eul\'eriens

Dominique Foata (Institut Lothaire , Strasbourg) , Marcel-Paul Sch\"utzenberger This is my paper
classification 🧮 math.CO
keywords eulerianpolynomialsalternatingavailablebeenclassicalcombinatorialcontains
0
0 comments X
read the original abstract

This is the classical monograph on the combinatorial study of Eulerian polynomials, published in 1970. It has been retyped in TeX and made available on the web with the kind permission of Springer-Verlag. This on-line version has an ouput of 49 pages. Written in French it contains the following items: 0. Introduction to and review of the Euler Numbers 1. General properties of the systems of exceedances and rises 2. The Eulerian polynomials 3. The exponential formula 4. Generating functions for the Eulerian polynomials 5. The alternating sums A(n)(-1) and B(n)(-1) 6. References

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Triangular Arrays using context-free grammar

    math.CO 2025-11 unverdicted novelty 5.0

    Triangular arrays defined by the recurrence T(n,k) = (a2 n + a1 k + a0) T(n-1,k) + (b2 n + b1 k + b0) T(n-1,k-1) are interpreted as increasing trees via the Hao grammar, yielding explicit formulas for r-Whitney-Euleri...