Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorAlbert, M.H.
dc.contributor.authorLinton, Stephen Alexander
dc.contributor.authorRuskuc, Nik
dc.contributor.authorVatter, V
dc.contributor.authorWaton, S
dc.date.accessioned2011-09-02T15:27:56Z
dc.date.available2011-09-02T15:27:56Z
dc.date.issued2011-05
dc.identifier.citationAlbert , 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.009en
dc.identifier.issn0012-365X
dc.identifier.otherPURE: 5162285
dc.identifier.otherPURE UUID: 5b3823aa-e881-4452-bff8-61f923090abe
dc.identifier.otherScopus: 79751538231
dc.identifier.otherORCID: /0000-0003-2415-9334/work/73702050
dc.identifier.urihttps://hdl.handle.net/10023/2000
dc.description.abstractA 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.
dc.language.isoeng
dc.relation.ispartofDiscrete Mathematicsen
dc.rightsThis 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.comen
dc.subjectAlgebraic generating functionen
dc.subjectInsertion encodingen
dc.subjectPermutation classen
dc.subjectRestricted permutationen
dc.subjectQA Mathematicsen
dc.subject.lccQAen
dc.titleOn convex permutationsen
dc.typeJournal articleen
dc.description.versionPreprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1016/j.disc.2011.01.009
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record