dc.contributor.author |
Duchi, Enrica |
dc.contributor.author |
Poulalhon, Dominique |
dc.contributor.author |
Universitat Autònoma de Barcelona. Centre de Recerca Matemàtica |
dc.date |
2008 |
dc.identifier |
https://ddd.uab.cat/record/44118 |
dc.identifier |
urn:oai:ddd.uab.cat:44118 |
dc.format |
application/pdf |
dc.language |
eng |
dc.publisher |
Centre de Recerca Matemàtica |
dc.relation |
Centre de Recerca Matemàtica. Prepublicacions ; |
dc.rights |
open access |
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 |
dc.rights |
https://creativecommons.org/licenses/by-nc-nd/2.5/ |
dc.subject |
Permutacions |
dc.title |
On square permutations |
dc.type |
Article |
dc.type |
Prepublicació |
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. |