The University of St Andrews

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:
This item has been viewed 6 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
convex.pdf118.8 kBAdobe PDFView/Open
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 . , 10.1016/j.disc.2011.01.009
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
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
Appears in Collections:Centre for Interdisciplinary Research in Computational Algebra (CIRCA) Research
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.


DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)