arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.12671math.CO
收藏

带间隔的 $k$-牌组问题

The Gapped $k$-Deck Problem

ECE Department University of Illinois(伊利诺伊大学电气与计算机工程系);Department of Mathematics University of Illinois(伊利诺伊大学数学系);Calit2 University of California, San Diego(加州大学圣地亚哥分校CALIT2)

Jonas Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic

AI总结:

本文提出带间隔的k-牌组重构问题,通过修改Morse-Thue构造和Dudik-Schulman方法,首次给出G_2(k)的构造性上界并加以改进。

摘要:

$k$-牌组问题关注的是寻找最小的正整数 $S(k)$,使得存在至少两个长度为 $S(k)$ 的字符串共享相同的 $k$-牌组,即长度为 $k$ 的子序列的多重集。我们引入了带间隔的 $k$-牌组重构这一新问题:对于给定的间隔参数 $s$,我们寻找最小的正整数 $G_s(k)$,使得存在至少两个长度为 $G_s(k)$ 的不同字符串,它们无法基于一组“带间隔”的 $k$-子序列来区分。间隔约束要求子序列中的元素在原始字符串中彼此相距至少 $s$ 个位置。我们的结果如下。首先,我们展示了如何通过对递归 Morse-Thue 字符串构造过程进行非平凡的修改,来构造共享相同 $2$-间隔 $k$-牌组的序列。这确立了 $G_2(k)$ 的第一个已知构造性上界。其次,我们利用 Dudik 和 Schulman 的方法进一步改进了这一上界。

英文摘要:

The $k$-deck problem is concerned with finding the smallest positive integer $S(k)$ such that there exist at least two strings of length $S(k)$ that share the same $k$-deck, i.e., the multiset of subsequences of length $k$. We introduce the new problem of gapped $k$-deck reconstruction: For a given gap parameter $s$, we seek the smallest positive integer $G_s(k)$ such that there exist at least two distinct strings of length $G_s(k)$ that cannot be distinguished based on a "gapped" set of $k$-subsequences. The gap constraint requires the elements in the subsequences to be at least $s$ positions apart within the original string. Our results are as follows. First, we show how to construct sequences sharing the same $2$-gapped $k$-deck using a nontrivial modification of the recursive Morse-Thue string construction procedure. This establishes the first known constructive upper bound on $G_2(k)$. Second, we further improve this bound using the approach by Dudik and Schulman.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑