Enumeration of pairs of permutations
From MaRDI portal
Publication:1223298
DOI10.1016/0012-365X(76)90035-2zbMath0322.05008MaRDI QIDQ1223298
Leonard Carlitz, Richard Scoville, Theresa P. Vaughan
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
Combinatorial objects enumerated by \(q\)-Bessel functions, Statistics on pairs of permutations, Basic calculus of signed permutations. I: Length and number of inversions, 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, Enumeration of arrays by column rises, A \(q\)-analogue of a result of Carlitz, Scoville and Vaughan via the homology of posets, A combinatorial proof of a result for permutation pairs, Enumeration of pairs of sequences by rises, falls and levels, 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, The Hecke group algebra of a Coxeter group and its representation theory.
Cites Work