Comlexity of prime-dimensional sequences over a finite field

Details Comlexity of prime-dimensional sequences over a finite field Comlexity of prime-dimensional sequences over a finite field

2007-10-18

arxiv.org/abs/0710.3451v1

Mathematics

Number Theory

4 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Comlexity of prime-dimensional sequences over a finite field does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comlexity of prime-dimensional sequences over a finite field, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comlexity of prime-dimensional sequences over a finite field will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-460801