On convex permutations
View/
Date
05/2011Keywords
Metadata
Show full item recordAltmetrics Handle Statistics
Altmetrics DOI Statistics
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.
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 . https://doi.org/10.1016/j.disc.2011.01.009
Publication
Discrete Mathematics
Status
Peer reviewed
ISSN
0012-365XType
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
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.