On square permutations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

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.
Fichier principal
Vignette du fichier
dmAI0112.pdf (143.2 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01194689 , version 1 (07-09-2015)

Identifiers

Cite

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⟩
122 View
834 Download

Altmetric

Share

Gmail Facebook X LinkedIn More