Use this identifier to quote or link this document: http://hdl.handle.net/2072/12814

On square permutations
Duchi, Enrica; Poulalhon, Dominique
Centre de Recerca Matemàtica
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.
2008-05
512 - Àlgebra
Permutacions
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/)
Preprint
Centre de Recerca Matemàtica
Prepublicacions del Centre de Recerca Matemàtica;809
         

Full text files in this document

Files Size Format
Pr809.pdf 194.3 KB PDF

Show full item record

 

Coordination

 

Supporters