arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1101.1172math.COcs.DM
收藏

k-半径序列的存在性

The existence of k-radius sequences

Simon R Blackburn

摘要:

令$n$和$k$是正整数,并且令$F$是大小为$n$的字母表。长度为$m$的$F$上的序列是\emph{$k$-radius sequence},如果$F$的任何两个不同元素在序列中的某处出现在彼此的距离$k$内。这些序列是由Jaromczyk和Lonc在2004年引入的,目的是在大型数据集(如医学图像)上计算某些函数时产生有效的缓存策略。令$f_k(n)$为最短$n$元$k$半径序列的长度。本文表明,使用概率的参数,每当$k$是固定的和$n\rightarrow\infty$ \[ f_k(n)\sim \frac{1}{k}\binom{n}{2}. \]-本文观察到,相同的参数推广到的情况下,我们需要以下更强的属性为一些整数$t$,使$2\leq t\leq k+1$:任何$t$不同的元素$F$必须同时发生在一个距离$k$彼此的某处序列。

英文摘要:

Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc in 2004, in order to produce an efficient caching strategy when computing certain functions on large data sets such as medical images. Let $f_k(n)$ be the length of the shortest $n$-ary $k$-radius sequence. The paper shows, using a probabilistic argument, that whenever $k$ is fixed and $n\rightarrow\infty$ \[ f_k(n)\sim \frac{1}{k}\binom{n}{2}. \] The paper observes that the same argument generalises to the situation when we require the following stronger property for some integer $t$ such that $2\leq t\leq k+1$: any $t$ distinct elements of $F$ must simultaneously occur within a distance $k$ of each other somewhere in the sequence.

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

↑