Use this identifier to quote or link this document:

Generating trees for permutations avoiding generalized patterns
Elizalde, Sergi
Centre de Recerca Matemàtica
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.
519.1 - Teoria general de l'anàlisi combinatòria. Teoria de grafs
Arbres (Teoria dels grafs)
Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús (
Centre de Recerca Matemàtica
Prepublicacions del Centre de Recerca Matemàtica;737

Full text files in this document

Files Size Format
Pr737.pdf 252.4 KB PDF

Show full item record