dc.contributor |
Centre de Recerca Matemàtica |
dc.contributor.author |
Duchi, Enrica |
dc.contributor.author |
Poulalhon, Dominique |
dc.date.accessioned |
2008-12-11T14:11:48Z |
dc.date.available |
2008-12-11T14:11:48Z |
dc.date.created |
2008-05 |
dc.date.issued |
2008-05 |
dc.identifier.uri |
http://hdl.handle.net/2072/12814 |
dc.format.extent |
19 |
dc.format.extent |
194357 bytes |
dc.format.mimetype |
application/pdf |
dc.language.iso |
eng |
dc.publisher |
Centre de Recerca Matemàtica |
dc.relation.ispartofseries |
Prepublicacions del Centre de Recerca Matemàtica;809 |
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/) |
dc.subject.other |
Permutacions |
dc.title |
On square permutations |
dc.type |
info:eu-repo/semantics/preprint |
dc.subject.udc |
512 - Àlgebra |
dc.description.abstract |
Severini and Mansour introduced in [4]square polygons, as graphical representations of square permutations, that is, permutations such that all entries are records (left or right, minimum or maximum), and they obtained a nice formula for their number. In
this paper we give a recursive construction for this class of permutations, that allows to simplify the derivation of their formula and to enumerate the subclass of square permutations with a simple record polygon. We also show that the generating function of these permutations with respect to the number of records of each type is algebraic, answering a question of Wilf in a particular case. |