A nonrecursive combinatorial rule for Eulerian numbers

DOI10.1016/0097-3165(77)90055-3MaRDI QIDQ1235170zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3061754 (Why is no real title available?)
• Théorie géométrique des polynômes eulériens

Cited in

(9)

• Maximal chains of subwords and up-down sequences of permutations
• 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
• The \(r\)-multipermutations
• A combinatorial proof of q-log-concavity of q-Eulerian numbers
• A maj statistic for set partitions

This page was built for publication: A nonrecursive combinatorial rule for Eulerian numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235170)