This article is available for purchase or by subscription. See below.
Abstract
|
We provide a cyclic permutation analogue of the Erdős–Szekeres theorem. In particular, we show that every
cyclic permutation of length
has either an increasing cyclic subpermutation of length
or a decreasing cyclic
subpermutation of length
,
and we show that the result is tight. We also characterize all maximum-length
cyclic permutations that do not have an increasing cyclic subpermutation of length
or a decreasing cyclic
subpermutation of length
.
|
PDF Access Denied
We have not been able to recognize your IP address
44.210.149.218
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 30.00:
Keywords
cyclic Erdős–Szekeres theorem
|
Mathematical Subject Classification 2010
Primary: 05D99
|
Milestones
Received: 7 April 2018
Revised: 9 July 2018
Accepted: 22 July 2018
Published: 8 October 2018
Communicated by Joshua Cooper
|
|