Enumeration of pairs of permutations
From MaRDI portal
Cites work
Cited in
(16)- The Hecke group algebra of a Coxeter group and its representation theory.
- Enumeration of arrays by column rises
- Enumeration of pairs of sequences by rises, falls and levels
- Combinatorial objects enumerated by q-Bessel functions
- Basic calculus of signed permutations. I: Length and number of inversions
- Statistics on pairs of permutations
- 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
- A combinatorial proof of a result for permutation pairs
- A q-analogue of a result of Carlitz, Scoville and Vaughan via the homology of posets
- Segre powers of posets preserve EL-shellability
- Homology of Segre powers of Boolean and subspace lattices
- The q-exponential generating function for permutations by consecutive patterns and inversions
- Permutations and words counted by consecutive patterns
- Combinatorics of normal sequences of braids
This page was built for publication: Enumeration of pairs of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1223298)