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

构造k-半径序列

Constructing k-radius sequences

Simon R. Blackburn, James F. McKee

摘要:

n元k半径序列是从大小为n的字母表中取出的元素的有限序列,使得字母表的任何两个不同元素在序列中的某处出现在彼此的距离k内。这些序列是由Jaromczyk和Lonc引入的,用于模拟在大型数据集(如医学图像)上计算某些函数的缓存策略。设f_k(n)是任意k-半径序列的最短长度。我们利用平铺和矩阵改进了先前对f_k(n)的估计。主要结果是:当Z^r存在一定的镶嵌时,f_k(n)~ n^2/(2k)当n趋于无穷大。特别地,这个结果对无穷多个k成立,包括所有k < 195和所有k使得k+1或2k+1是素数。对于一定的k,特别是当2k+1是素数时,我们利用矩阵理论得到了一个更尖锐的误差项。

英文摘要:

An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc to model a caching strategy for computing certain functions on large data sets such as medical images. Let f_k(n) be the shortest length of any k-radius sequence. We improve on earlier estimates for f_k(n) by using tilings and logarithms. The main result is that f_k(n) ~ n^2/(2k) as n tends to infinity whenever a certain tiling of Z^r exists. In particular this result holds for infinitely many k, including all k < 195 and all k such that k+1 or 2k+1 is prime. For certain k, in particular when 2k+1 is prime, we get a sharper error term using the theory of logarithms.

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

↑