|
Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10023/2000
| Title: | On convex permutations |
| Authors: | Albert, M.H.
Linton, Stephen Alexander
Ruskuc, Nik
Vatter, V
Waton, S |
| Keywords: | Algebraic generating function
Insertion encoding
Permutation class
Restricted permutation
QA Mathematics |
| Issue Date: | May-2011 |
| Citation: | Albert , M H , Linton , S A , Ruskuc , N , Vatter , V & Waton , S 2011 , ' On convex permutations ' Discrete Mathematics , vol 311 , no. 8-9 , pp. 715-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. |
| Version: | Preprint |
| Status: | Peer reviewed |
| URI: | http://hdl.handle.net/10023/2000 |
| DOI: | http://dx.doi.org/10.1016/j.disc.2011.01.009 |
| ISSN: | 0012-365X |
| Type: | Journal article |
| Rights: | This is an author version of the article, which may be different to the published version. The published version is copyright (c)2011 Elsevier B.V. available from http://www.sciencedirect.com |
| Appears in Collections: | University of St Andrews Research
Computer Science Research
Pure Mathematics Research
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
