arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.3451math.NTmath.DSmath.RT
收藏

有限域上素维序列的复杂性

Comlexity of prime-dimensional sequences over a finite field

E. Yu Lerner

摘要:

V.I. Arnold最近借助有限差分算子定义了$n$ 0和1序列的复杂性。本文给出了维数为素数的$n$的有限域中几乎最复杂的元素序列的结果。我们证明,与$n\to \infty$这个属性是固有的,在几乎所有的序列,而乘性函数的值具有这个属性与任何$n$不同的字段的特性。我们还描述了素数的参数$n$,使对数函数几乎最复杂。所有这些序列都显示出更强的复杂性;其代数意义非常清楚。

英文摘要:

V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a finite field, whose dimension $n$ is a prime number. We prove that with $n\to \infty$ this property is inherent in almost all sequences, while the values of multiplicative functions possess this property with any $n$ different from the characteristic of the field. We also describe the prime values of the parameter $n$ which make the logarithmic function almost most complicated. All these sequences reveal a stronger complexity; its algebraic sense is quite clear.

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

↑