Preprint Article Version 1 This version is not peer-reviewed

What do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know About Each Other?

Version 1 : Received: 21 August 2019 / Approved: 23 August 2019 / Online: 23 August 2019 (11:35:32 CEST)

A peer-reviewed article of this Preprint also exists.

Itskovich, E.J.; Levit, V.E. What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms 2019, 12, 237. Itskovich, E.J.; Levit, V.E. What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms 2019, 12, 237.

Journal reference: Algorithms 2019, 12, 237
DOI: 10.3390/a12110237

Abstract

As a kind of converse of the celebrated Erd˝os-Szekeres theorem, we present a necessary and sufficient condition for a sequence of length n to contain a longest increasing subsequence and a longest decreasing subsequence of given lengths x and y, respectively.

Subject Areas

Erd˝os-Szekeres theorem; longest increasing sequence; longest decreasing sequence

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.