A nonrecursive combinatorial rule for Eulerian numbers

DOI10.1016/0097-3165(77)90055-3zbMath0351.05009OpenAlexW2050784917MaRDI QIDQ1235170

H. O. Foulkes

Publication date: 1977

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(77)90055-3

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

The \(r\)-multipermutations, Eulerian numbers, Newcomb's problem and representations of symmetric groups, The r-major index, On the lattice path method in convolution-type combinatorial identities. II: The weighted counting function method on lattice paths, A characterization of permutations via skew-hooks, A note on q-Eulerian numbers, Maximal chains of subwords and up-down sequences of permutations, A maj statistic for set partitions

Cites Work

• Théorie géométrique des polynômes eulériens
• Unnamed Item
• Unnamed Item