What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?
Keyword(s):
As a kind of converse of the celebrated Erdős–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.
2017 ◽
Vol E100.A
(12)
◽
pp. 2764-2775
◽