Itskovich, E.J.; Levit, V.E. What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms2019, 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.
Itskovich, E.J.; Levit, V.E. What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms2019, 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.
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.
Computer Science and Mathematics, Computational Mathematics
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.