On square permutations
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 recursiv...
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | English |
| Publicado em: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| coleção: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acesso em linha: | https://dmtcs.episciences.org/3565/pdf |