Title of article
On convex permutations
Author/Authors
Albert، نويسنده , , Michael H. and Linton، نويسنده , , Steve and Ru?kuc، نويسنده , , Nik and Vatter، نويسنده , , Vincent and Waton، نويسنده , , Steve، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
8
From page
715
To page
722
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
Permutation class , Restricted permutation , algebraic generating function , Insertion encoding
Journal title
Discrete Mathematics
Serial Year
2011
Journal title
Discrete Mathematics
Record number
1598397
Link To Document