渐近最短k-半径序列的构造
Constructions of asymptotically shortest k-radius sequences
摘要:
设k为正整数。在n元字母表A上的序列s称为k半径序列,如果从A开始的每两个符号在s中出现的距离不超过k。设f_k(n)表示A上最短k-半径序列的长度。我们给出的构造证明了:(1)对每个固定的k和对每个固定的e>0,f_k(n)= n^2/(2k)+O(n^(1+e))和(2)对每个k,其中k是n^a的整数部分,对于某个固定的实数a,使得0 < a <1,f_k(n)= n^2/(2k)+O(n^b),对于某个b <2-a.当f_k(n)>= n^2/(2k)- n/(2k)时,给出了渐近最优的k-半径序列.最后,(3)我们构造了2 p元字母表的最优2-半径序列,其中p是素数。
英文摘要:
Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We provide constructions demonstrating that (1) for every fixed k and for every fixed e>0, f_k(n) = n^2/(2k) +O(n^(1+e)) and (2) for every k, where k is the integer part of n^a for some fixed real a such that 0 < a <1, f_k(n) = n^2/(2k) +O(n^b), for some b <2-a. Since f_k(n) >= n^2/(2k) - n/(2k), the constructions give asymptotically optimal k-radius sequences. Finally, (3) we construct optimal 2-radius sequences for a 2p-element alphabet, where p is a prime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。