The \(q\)-exponential generating function for permutations by consecutive patterns and inversions

DOI10.1016/j.jcta.2006.03.004zbMath1105.05003OpenAlexW2006638646MaRDI QIDQ857426

Don Rawlings

Publication date: 14 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.03.004

zbMATH Keywords

cluster generating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 ⋮ A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Patterns in permutations and words.
• Permutations and words counted by consecutive patterns
• Enumeration of words by their number of mistakes
• Enumeration of pairs of permutations
• Consecutive patterns in permutations
• Adjacencies in words
• Partially ordered generalized patterns
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences