A nonrecursive combinatorial rule for Eulerian numbers

DOI10.1016/0097-3165(77)90055-3zbMATH Open0351.05009OpenAlexW2050784917MaRDI QIDQ1235170FDOQ1235170

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

• Title not available (Why is that?)
• Théorie géométrique des polynômes eulériens
• Title not available (Why is that?)

Cited In (9)

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

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)