What do a longest increasing subsequence and a longest decreasing subsequence know about each other?

Elizabeth J. Itskovich; Vadim E. Levit

doi:10.3390/a12110237

What do a longest increasing subsequence and a longest decreasing subsequence know about each other?

Elizabeth J. Itskovich, Vadim E. Levit

Ariel University

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

1 Scopus citations

Abstract

As a kind of converse of the celebrated Erdos-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.

Original language	English
Article number	237
Journal	Algorithms
Volume	12
Issue number	11
DOIs	https://doi.org/10.3390/a12110237
State	Published - 1 Nov 2019
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2019 by the authors.

Keywords

Erdos-Szekeres theorem
Longest decreasing sequence
Longest increasing sequence

Access to Document

10.3390/a12110237

Cite this

@article{082c83d4a0b640158c3c0d7786bcf2ac,

title = "What do a longest increasing subsequence and a longest decreasing subsequence know about each other?",

abstract = "As a kind of converse of the celebrated Erdos-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.",

keywords = "Erdos-Szekeres theorem, Longest decreasing sequence, Longest increasing sequence",

author = "Itskovich, {Elizabeth J.} and Levit, {Vadim E.}",

note = "Publisher Copyright: {\textcopyright} 2019 by the authors.",

year = "2019",

month = nov,

day = "1",

doi = "10.3390/a12110237",

language = "אנגלית",

volume = "12",

journal = "Algorithms",

issn = "1999-4893",