|
|||||
|
|
On convex permutations |
|
| Authors: | Michael H. Albert Steve Linton Nik Ruškuc Vincent Vatter Steve Waton |
| Affiliation: | 1. Department of Computer Science, University of Otago, Dunedin, New Zealand;2. School of Computer Science, University of St Andrews, St Andrews, Fife, Scotland, United Kingdom;3. School of Mathematics and Statistics, University of St Andrews, St Andrews, Fife, Scotland, United Kingdom;4. Department of Mathematics, University of Florida, Gainesville, FL, USA |
| Abstract: | A selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion. We characterise and enumerate those permutations which arise in this manner and exhibit some interesting structural properties of the permutation class they form. We conclude with a permutation analogue of the celebrated Happy Ending Problem. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |