A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
From MaRDI portal
Publication:2109230
Abstract: The Goulden-Jackson cluster method is a powerful tool for counting words by occurrences of prescribed subwords, and was adapted by Elizalde and Noy for counting permutations by occurrences of prescribed consecutive patterns. In this paper, we lift the cluster method for permutations to the Malvenuto-Reutenauer algebra. Upon applying standard homomorphisms, our result specializes to both the cluster method for permutations as well as a q-analogue which keeps track of the inversion number statistic. We construct additional homomorphisms using the theory of shuffle-compatibility, leading to further specializations which keep track of various "inverse statistics", including the inverse descent number, inverse peak number, and inverse left peak number. This approach is then used to derive formulas for counting permutations by occurrences of two families of consecutive patterns -- monotone patterns and transpositional patterns -- refined by these statistics.
Recommendations
- Refined consecutive pattern enumeration via a generalized cluster method
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Applying the cluster method to count occurrences of generalized permutation patterns
- scientific article; zbMATH DE number 7058688
- A generalized Goulden-Jackson cluster method and lattice path enumeration
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- A generalized Goulden-Jackson cluster method and lattice path enumeration
- A historical survey of P-partitions
- A survey of consecutive patterns in permutations
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- An introduction to quasisymmetric Schur functions. Hopf algebras, quasisymmetric functions, and Young composition tableaux.
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Consecutive patterns in permutations
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- Counting permutations by alternating descents
- Counting permutations by runs
- Duality between quasi-symmetric functions and the Solomon descent algebra
- Enriched \(P\)-partitions and peak algebras
- Enriched 𝑃-Partitions
- Enumerative combinatorics. Volume 2.
- Eulerian Numbers
- Eulerian polynomials and descent statistics
- Fibonacci numbers, consecutive patterns, and inverse peaks
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS VI: FREE QUASI-SYMMETRIC FUNCTIONS AND RELATED ALGEBRAS
- Noncommutative symmetric functions
- On consecutive pattern-avoiding permutations of length 4, 5 and beyond
- Permutation patterns and statistics
- Permutation statistics and partitions
- Reciprocals of exponential polynomials and permutation enumeration
- Refined consecutive pattern enumeration via a generalized cluster method
- Restricted permutations
- Shuffle-compatible permutation statistics
- The \(q\)-exponential generating function for permutations by consecutive patterns and inversions
- The \({1/k}\)-Eulerian polynomials
- The algebraic combinatorics of snakes
- The most and the least avoided consecutive patterns
- The probability of avoiding consecutive patterns in the Mallows distribution
- Wilf equivalence relations for consecutive patterns
Cited in
(7)- An application of the Goulden-Jackson cluster theorem
- A generalized Goulden-Jackson cluster method and lattice path enumeration
- Applying the cluster method to count occurrences of generalized permutation patterns
- Two-sided permutation statistics via symmetric functions
- Statistics on clusters and \(r\)-Stirling permutations-Stirling permutations
- Refined consecutive pattern enumeration via a generalized cluster method
- Fibonacci numbers, consecutive patterns, and inverse peaks
This page was built for publication: A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109230)
