DOAJ
Open Access
2008
On square permutations
Enrica Duchi
Dominique Poulalhon
Abstrak
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.
Topik & Kata Kunci
Penulis (2)
E
Enrica Duchi
D
Dominique Poulalhon
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2008
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.3565
- Akses
- Open Access ✓