Generating functions for permutations avoiding a consecutive pattern
From MaRDI portal
Publication:659579
Recommendations
- Permutations and words counted by consecutive patterns
- scientific article; zbMATH DE number 7058688
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
Cites work
Cited in
(10)- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Cyclic pattern containment and avoidance
- Generating functions of permutations with respect to their alternating runs
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- scientific article; zbMATH DE number 6683606 (Why is no real title available?)
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- The combinatorics of Jeff Remmel
- scientific article; zbMATH DE number 7058688 (Why is no real title available?)
- Rational generating series for affine permutation pattern avoidance
- Permutations and words counted by consecutive patterns
This page was built for publication: Generating functions for permutations avoiding a consecutive pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659579)