Online Permutation Embedding: Optimal Stopping and Scaling Laws

2026-08-19

AI Summary

研究通过有效动态规划和在线算法解决随机序列中嵌入给定排列的问题，并探讨了不同类型排列的最优嵌入时间及其渐近扩展规律。

Abstract

We study optimal online algorithms for embedding a permutation $π$ of $[k]$ into an iid stream of uniform $[0,1]$ random variables. This problem is a broad generalization of the classical online monotone subsequence selection problem, recovered in the special case $π=\mathrm{Id}_k$. Our first contribution is an efficiently solvable dynamic program for the optimal embedding time of any $k$-permutation $π$. This dynamic program also yields an explicit optimal online embedding algorithm. We then investigate the asymptotic scaling of the optimal embedding time for uniformly random target permutations, as well as the extremal problem of identifying the permutations with largest expected online embedding time. Our second main result shows that, to first order, random permutations are strictly faster to embed than monotone permutations, which in turn are strictly faster to embed than the extremal permutations. This separation stands in sharp contrast to prevailing conjectures and heuristics in the offline theory of permutation embeddings.

Problem

• online permutation embedding
• optimal stopping
• scaling laws

Innovation

• Online Permutation Embedding
• Dynamic Program
• Optimal Stopping
• Scaling Laws
• Uniform Random Permutations