activity
20072021
most citedThe Zipf law for random texts with unequal probabilities of occurrence of letters and the Pascal pyramid

7 citations · 25 across the 12 of their papers we have counts for

collaborators
Showing 2007 · math.NTShow all

3 papers · 2 filters

math.NT2007

Comlexity of prime-dimensional sequences over a finite field

E. Yu Lerner

V.I. Arnold has recently defined the complexity of a sequence of zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtai…

math.NT2007★ 4 cited

Multiplicative function instead of logarithm (an elementary approach)

E. Yu. Lerner

V.I. Arnold has recently defined the complexity of finite sequences of zeroes and ones in terms of periods and preperiods of attractors of a dynamic system of the operator of finit…

math.NT2007★ 1 cited

Tables of graphs of binary and ternary sequences differentiation

E. Yu. Lerner

Let be a cyclic sequence of elements of the finite field (the first element immediately follows the -th one). Let us define the operation as the trans…