You are currently viewing a beta version of our website. If you spot anything unusual, kindly let us know.
Preprint
Article
What do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know About Each Other?
Altmetrics
Downloads
340
Views
256
Comments
0
A peer-reviewed article of this preprint also exists.
This version is not peer-reviewed
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.
Keywords:
Subject: Computer Science and Mathematics - Computational Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Submitted:
21 August 2019
Posted:
23 August 2019
You are already at the latest version
Alerts
A peer-reviewed article of this preprint also exists.
This version is not peer-reviewed
Submitted:
21 August 2019
Posted:
23 August 2019
You are already at the latest version
Alerts
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.
Keywords:
Subject: Computer Science and Mathematics - Computational Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
About the Orbit Structure of Sequences of Maps of Integers
Viorel Niţică
et al.
Symmetry,
2019
SIMIT: Subjectively Interesting Motifs in Time Series
Junning Deng
et al.
Entropy,
2019
MDPI Initiatives
Important Links
© 2024 MDPI (Basel, Switzerland) unless otherwise stated