Generating trees for permutations avoiding generalized patterns
We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition abou...
| Autor: | |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2007 |
| País: | España |
| Recursos: | Universitat Autònoma de Barcelona |
| Repositório: | Dipòsit Digital de Documents de la UAB |
| Idioma: | inglês |
| OAI Identifier: | oai:ddd.uab.cat:44039 |
| Acesso em linha: | https://ddd.uab.cat/record/44039 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Permutacions Arbres (Teoria dels grafs) |
| Resumo: | We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones. |
|---|