Using homological duality in consecutive pattern avoidance
From MaRDI portal
Abstract: Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding elements of these collections as consecutive patterns. In short, the coincidence of the latter generating functions is guaranteed by a length-preserving bijection of patterns in these collections which is identical on the overlappings of pairs of patterns where the overlappings are considered as unordered sets. Our proof is based on a direct algorithm for the computation of the inverse generating functions. As an application we present a large class of patterns where this algorithm is fast and, in particular, allows to obtain a linear ordinary differential equation with polynomial coefficients satisfied by the inverse generating function.
Recommendations
- scientific article; zbMATH DE number 7058688
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- On consecutive pattern-avoiding permutations of length 4, 5 and beyond
- Applying a reciprocity method to count permutations avoiding two families of consecutive patterns
- Computational approaches to consecutive pattern avoidance in permutations
Cited in
(7)- Wilf equivalence relations for consecutive patterns
- A necessary condition for c-Wilf equivalence
- Clusters, generating functions and asymptotics for consecutive patterns in permutations
- Multiple pattern avoidance with respect to fixed points and excedances
- On consecutive pattern-avoiding permutations of length 4, 5 and beyond
- Consecutive pattern containment and c-Wilf equivalence
- On the generating function for consecutively weighted permutations
This page was built for publication: Using homological duality in consecutive pattern avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540139)
