On square permutations

Abstract : Severini and Mansour introduced $\textit{square polygons}$, as graphical representations of $\textit{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.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/hal-01194689
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, September 7, 2015 - 12:51:12 PM
Last modification on : Saturday, November 20, 2021 - 3:49:32 AM
Long-term archiving on: : Tuesday, December 8, 2015 - 1:03:05 PM

File

dmAI0112.pdf
Publisher files allowed on an open archive

Citation

Enrica Duchi, Dominique Poulalhon. On square permutations. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.207-222, ⟨10.46298/dmtcs.3565⟩. ⟨hal-01194689⟩

Record views