跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26297 · v1

Exact guarantees and faster algorithms for $k$-rollercoasters

首次提交 2026-11-19 23:51
版本更新 2026-11-19 23:51
雷达观测 2026-11-20 14:52
arXiv ↗PDF ↗

摘要

For k≥3k\ge3, a kk-rollercoaster is a sequence of distinct values whose maximal increasing and decreasing runs all have length at least kk. We discover the maximum guaranteed length fk(n)f_k(n) of kk-rollercoasters appearing as subsequences of nn-point permutations. In particular, letting q=k−1q=k-1, we prove that fk(n)=⌈n/q⌉f_k(n)= \lceil n/q\rceil for n≥2q2n\ge2q^2, fk(n)=2q−⌊2q2−n⌋f_k(n)= 2q-\lfloor \sqrt{2q^2-n}\rfloor for q2<n<2q2q^2<n<2q^2 and fk(n)=0f_k(n)= 0 otherwise. We prove that the guarantees are tight by constructing an nn-point permutation whose longest kk-rollercoaster has exactly fk(n)f_k(n) points. Our proof extends Seidenberg's argument [Journal of the London Mathematical Society, 1959] for proving the Erdős--Szekeres theorem by representing points in a subsequence with respect to the lengths of longest monotonic (increasing and decreasing) subsequences that reach each point. The combinatorial proof yields a deterministic comparison-based algorithm that finds a rollercoaster of length at least fk(n)f_k(n) in O(nlog⁡fk(n))O(n\log f_k(n)) time and O(n)O(n) space for n>q2n>q^2. Independently, we give an O(nklog⁡k)O(nk\log k)-time, O(nk)O(nk)-space algorithm for a longest kk-rollercoaster, improving the previous O(nk2)O(nk^2) bound. We use the dynamic program of Gawrychowski et al. [STACS 2019, Algorithmica 2022], and process its weighted predecessor queries through monotone subsequences with finger-search trees. Both algorithms return such subsequences.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 23:51 · 最新观测版本

Exact guarantees and faster algorithms for $k$-rollercoasters

For k≥3k\ge3, a kk-rollercoaster is a sequence of distinct values whose maximal increasing and decreasing runs all have length at least kk. We discover the maximum guaranteed length fk(n)f_k(n) of kk-rollercoasters appearing as subsequences of nn-point permutations. In particular, letting q=k−1q=k-1, we prove that fk(n)=⌈n/q⌉f_k(n)= \lceil n/q\rceil for n≥2q2n\ge2q^2, fk(n)=2q−⌊2q2−n⌋f_k(n)= 2q-\lfloor \sqrt{2q^2-n}\rfloor for q2<n<2q2q^2<n<2q^2 and fk(n)=0f_k(n)= 0 otherwise. We prove that the guarantees are tight by constructing an nn-point permutation whose longest kk-rollercoaster has exactly fk(n)f_k(n) points. Our proof extends Seidenberg's argument [Journal of the London Mathematical Society, 1959] for proving the Erdős--Szekeres theorem by representing points in a subsequence with respect to the lengths of longest monotonic (increasing and decreasing) subsequences that reach each point. The combinatorial proof yields a deterministic comparison-based algorithm that finds a rollercoaster of length at least fk(n)f_k(n) in O(nlog⁡fk(n))O(n\log f_k(n)) time and O(n)O(n) space for n>q2n>q^2. Independently, we give an O(nklog⁡k)O(nk\log k)-time, O(nk)O(nk)-space algorithm for a longest kk-rollercoaster, improving the previous O(nk2)O(nk^2) bound. We use the dynamic program of Gawrychowski et al. [STACS 2019, Algorithmica 2022], and process its weighted predecessor queries through monotone subsequences with finger-search trees. Both algorithms return such subsequences.

查看此版本解读 →查看此版本原文 ↗