A note on q-Eulerian numbers

DOI10.1016/0097-3165(78)90038-9zbMath0386.05003OpenAlexW1973704709MaRDI QIDQ1249578

Leonard Carlitz

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90038-9

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

A \(q\)-analog of Newton's series, Stirling functions and Eulerian functions ⋮ Higher-order Bernoulli, Euler and Hermite polynomials ⋮ The r-major index ⋮ On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths ⋮ A combinatorial proof of \(q\)-log-concavity of \(q\)-Eulerian numbers ⋮ Unnamed Item ⋮ Maximal chains of subwords and up-down sequences of permutations

Cites Work

• A nonrecursive combinatorial rule for Eulerian numbers
• A note on concavity properties of triangular arrays of numbers
• A Combinatorial Property of q-Eulerian Numbers
• q-Bernoulli and Eulerian Numbers
• Unnamed Item

This page was built for publication: A note on q-Eulerian numbers