4 citations · 5 across the 2 of their papers we have counts for
2 papers
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…