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

DOI10.1016/J.JCTA.2006.03.004MaRDI QIDQ857426zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Permutations and words counted by consecutive patterns
• scientific article; zbMATH DE number 7058688
• Basic calculus of signed permutations. I: Length and number of inversions
• Consecutive patterns in permutations
• A \(q\)-analog of the exponential formula. (Reprint)

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• Adjacencies in words
• An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
• Consecutive patterns in permutations
• Enumeration of pairs of permutations
• Enumeration of words by their number of mistakes
• Partially ordered generalized patterns
• Patterns in permutations and words.
• Permutations and words counted by consecutive patterns

Cited in

(4)

• Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine
• A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
• A \(q\)-analog of the exponential formula. (Reprint)
• The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2

This page was built for publication: The \(q\)-exponential generating function for permutations by consecutive patterns and inversions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857426)