Enumeration of pairs of sequences by rises, falls and levels
From MaRDI portal
Cites work
Cited in
(26)- The Hecke group algebra of a Coxeter group and its representation theory.
- Note on enumeration of partitions contained in a given shape
- Polytopes, permutation shapes and bin packing
- A generalized Goulden-Jackson cluster method and lattice path enumeration
- The colored symmetric and exterior algebras
- Schur positivity and labeled binary trees
- Generating functions for alternating descents and alternating major index
- An application of the Goulden-Jackson cluster theorem
- Counting all unfolded self-avoiding walks on a finite lattice strip of width three
- Koszul duality for monoids and the operad of enriched rooted trees
- On a conjecture by Dehornoy
- Chromatic quasisymmetric functions
- 𝑞-Eulerian polynomials: Excedance number and major index
- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
- Counting words with Laguerre series
- Pseudo-involutions in the Riordan group
- scientific article; zbMATH DE number 7203447 (Why is no real title available?)
- Counting domino tilings of rectangles via resultants
- Eulerian quasisymmetric functions
- Difference ascent sequences
- The e-positivity of the chromatic symmetric function for twinned paths and cycles
- Characters and chromatic symmetric functions
- Permutations and words counted by consecutive patterns
- Greatest descents after any maxima in compositions
This page was built for publication: Enumeration of pairs of sequences by rises, falls and levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234297)