The Euler-Catalan Identity

@article{Rawlings1988TheEI,
  title={The Euler-Catalan Identity},
  author={D. Rawlings},
  journal={Eur. J. Comb.},
  year={1988},
  volume={9},
  pages={53-60}
}
  • D. Rawlings
  • Published 1988
  • Mathematics, Computer Science
  • Eur. J. Comb.
  • The enumeration of permutations by descents, major index, inversion number, and certain three letter patterns leads to a multivariable recurrence relationship which simultaneously contains generalizations of both the Catalan and Eulerian numbers. 

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Fractions Continues, q-Nombres de Catalan etq-Polynômes de Genocchi
    • 16
    • Open Access
    q, p-Analogue des nombres de Catalan
    • 9
    • Highly Influenced
    • Open Access
    Noncrossing partitions
    • 170
    • Open Access
    Sorted and/or sortable permutations
    • 32
    • Open Access
    Mahonian pairs
    • 27
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES
    Generalized Worpitzky Identities with Applications to Permutation Enumeration
    • 33
    • Open Access
    q-Catalan Numbers
    • 334
    • Open Access
    Binomial Posets, Möbius Inversion, and Permutation Enumeration
    • 146
    • Open Access
    The theory of partitions
    • 1,506
    • Open Access
    Stack sortable permutations
    • D. Rotem
    • Mathematics, Computer Science
    • 1981
    • 51
    • Open Access
    Two element lattice permutation numbers and their $q$-generalization
    • 101
    • Highly Influential
    Generating functions and enumeration of sequences.
    • 114
    Eulerian differential operators
    • 1971
    The art o] computer programming; vol. i
    • 5