## Abstract

Using the approach suggested in [2] we present 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 us to obtain a linear ordinary differential equation with polynomial coefficients satisfied by the inverse generating function.

Original language | English |
---|---|

Pages (from-to) | 1-17 |

Number of pages | 17 |

Journal | Electronic Journal of Combinatorics |

Volume | 18 |

Issue number | 2 |

DOIs | |

State | Published - 2011 |

Externally published | Yes |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics