dc.contributor
Centre de Recerca Matemàtica
dc.contributor.author
Elizalde, Sergi
dc.date.accessioned
2007-06-25T14:52:33Z
dc.date.accessioned
2024-09-19T13:20:57Z
dc.date.available
2007-06-25T14:52:33Z
dc.date.available
2024-09-19T13:20:57Z
dc.identifier.uri
http://hdl.handle.net/2072/4228
dc.description.abstract
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.
cat
dc.format.extent
252432 bytes
dc.format.mimetype
application/pdf
dc.publisher
Centre de Recerca Matemàtica
ca
dc.relation.ispartofseries
Prepublicacions del Centre de Recerca Matemàtica;737
dc.rights
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 (http://creativecommons.org/licenses/by-nc-nd/2.5/es/)
cat
dc.subject.other
Permutacions
ca
dc.subject.other
Arbres (Teoria dels grafs)
ca
dc.title
Generating trees for permutations avoiding generalized patterns
ca
dc.type
info:eu-repo/semantics/preprint
ca
