On convex permutations

M.H. Albert; Stephen Alexander Linton; Nik Ruskuc; V Vatter; S Waton

doi:10.1016/j.disc.2011.01.009

On convex permutations

M.H. Albert
, Stephen Alexander Linton
, Nik Ruskuc
, V Vatter
, S Waton

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	715-722
Journal	Discrete Mathematics
Volume	311
Issue number	8-9
Early online date	16 Feb 2011
DOIs	https://doi.org/10.1016/j.disc.2011.01.009
Publication status	Published - May 2011

Keywords

Algebraic generating function
Insertion encoding
Permutation class
Restricted permutation

Access to Document

10.1016/j.disc.2011.01.009

Convex
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
Submitted manuscript, 119 KB

Handle.net

Persistent link to portal record

Cite this

@article{5b3823aae8814452bff861f923090abe,

title = "On convex permutations",

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 = "Algebraic generating function, Insertion encoding, Permutation class, Restricted permutation",

author = "M.H. Albert and Linton, \{Stephen Alexander\} and Nik Ruskuc and V Vatter and S Waton",

year = "2011",

month = may,

doi = "10.1016/j.disc.2011.01.009",

language = "English",

volume = "311",

pages = "715--722",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "8-9",

}

TY - JOUR

T1 - On convex permutations

AU - Albert, M.H.

AU - Linton, Stephen Alexander

AU - Ruskuc, Nik

AU - Vatter, V

AU - Waton, S

PY - 2011/5

Y1 - 2011/5

N2 - 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.

AB - 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.

KW - Algebraic generating function

KW - Insertion encoding

KW - Permutation class

KW - Restricted permutation

U2 - 10.1016/j.disc.2011.01.009

DO - 10.1016/j.disc.2011.01.009

M3 - Article

SN - 0012-365X

VL - 311

SP - 715

EP - 722

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8-9

ER -

On convex permutations

Abstract

Keywords

Access to Document

Handle.net

Fingerprint

Cite this