Multiplicative function instead of logarithm (an elementary approach)
From MaRDI portal
Publication:6207097
Authors: E. Yu. Lerner 
Publication date: 10 October 2007
Abstract: 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 finite differentiation. Arnold has set up a hypothesis that the sequence of the values of the logarithm is most complicated or almost most complicated. In this paper we obtain the necessary and sufficient conditions which make this sequence (supplemented with zero) most complicated for a more wide class of operators. We prove that a sequence of values of a multiplicative function in a finite field is most complicated or almost most complicated for any operator divisible by the differentiation operator.
Polynomials over finite fields (11T06) Combinatorial dynamics (types of periodic orbits) (37E15) Other character sums and Gauss sums (11T24)
This page was built for publication: Multiplicative function instead of logarithm (an elementary approach)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207097)
