Next Article in Journal
Microscopic Object Recognition and Localization Based on Multi-Feature Fusion for In-Situ Measurement In Vivo
Previous Article in Journal
Stability Analysis of Jacobian-Free Newton’s Iterative Method
Previous Article in Special Issue
Cyclotomic Trace Codes
Open AccessArticle

What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?

Department of Computer Science, Ariel University, Ariel 40700, Israel
*
Authors to whom correspondence should be addressed.
Algorithms 2019, 12(11), 237; https://doi.org/10.3390/a12110237
Received: 21 August 2019 / Revised: 23 October 2019 / Accepted: 29 October 2019 / Published: 7 November 2019
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. View Full-Text
Keywords: Erdős–Szekeres theorem; longest increasing sequence; longest decreasing sequence Erdős–Szekeres theorem; longest increasing sequence; longest decreasing sequence
MDPI and ACS Style

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.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop