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

Department of Mathematics

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

2 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

Keywords

Erdos-Szekeres theorem
Longest decreasing sequence
Longest increasing sequence

Access to Document

10.3390/a12110237

Cite this

@article{dde840e3097a41e983eaf39545f63d4f,

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",