Ergodic Transformations of the Space of pp-adic Integers

Let $\mathcal L_1$ be the set of all mappings $f\colon\Z_p\Z_p$ of the space of all $p$-adic integers $\Z_p$ into itself that satisfy Lipschitz condition with a constant 1. We prove that the mapping $f\in\mathcal L_1$ is ergodic with respect to the normalized Haar measure on $\Z_p$ if and only if $f$ induces a single cycle permutation on each residue ring $\Z/p^k\Z$ modulo $p^k$, for all $k=1,2,3,...$. The multivariate case, as well as measure-preserving mappings, are considered also. Results of the paper in a combination with earlier results of the author give explicit description of ergodic mappings from $\mathcal L_1$. This characterization is complete for $p=2$. As an application we obtain a characterization of polynomials (and certain locally analytic functions) that induce ergodic transformations of $p$-adic spheres. The latter result implies a solution of a problem (posed by A.~Khrennikov) about the ergodicity of a perturbed monomial mapping on a sphere.Comment: To be published in Proceedings of the 2-nd Int'l Conference on p-adic Mathematical Physics (15-25 Sept., 2005, Belgrade

Automata finiteness criterion in terms of van der Put series of automata functions

In the paper we develop the $p$-adic theory of discrete automata. Every automaton $\mathfrak A$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic integers to $p$ integers, the automaton function $f_\mathfrak A$. The $p$-adic theory (in particular, the $p$-adic ergodic theory) turned out to be very efficient in a study of properties of automata expressed via properties of automata functions. In the paper we prove a criterion for finiteness of the number of states of automaton in terms of van der Put series of the automaton function. The criterion displays connections between $p$-adic analysis and the theory of automata sequences

The Non-Archimedean Theory of Discrete Systems

In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system: We call a system completely transitive if, given arbitrary pair $a,b$ of finite words that have equal lengths, the system $\mathfrak A$, while evolution during (discrete) time, at a certain moment transforms $a$ into $b$. To every system $\mathfrak A$, we put into a correspondence a family $\mathcal F_{\mathfrak A}$ of continuous maps of a suitable non-Archimedean metric space and show that the system is completely transitive if and only if the family $\mathcal F_{\mathfrak A}$ is ergodic w.r.t. the Haar measure; then we find easy-to-verify conditions the system must satisfy to be completely transitive. The theory can be applied to analyze behavior of straight-line computer programs (in particular, pseudo-random number generators that are used in cryptography and simulations) since basic CPU instructions (both numerical and logical) can be considered as continuous maps of a (non-Archimedean) metric space $\mathbb Z_2$ of 2-adic integers.Comment: The extended version of the talk given at MACIS-201

Ergodicity criteria for non-expanding transformations of 2-adic spheres

In the paper, we obtain necessary and sufficient conditions for ergodicity (with respect to the normalized Haar measure) of discrete dynamical systems $$ on 2-adic spheres $\mathbf S_{2^{-r}}(a)$ of radius $2^{-r}$, $r\ge 1$, centered at some point $a$ from the ultrametric space of 2-adic integers $\mathbb Z_2$. The map $f\colon\mathbb Z_2\to\mathbb Z_2$ is assumed to be non-expanding and measure-preserving; that is, $f$ satisfies a Lipschitz condition with a constant 1 with respect to the 2-adic metric, and $f$ preserves a natural probability measure on $\mathbb Z_2$, the Haar measure $\mu_2$ on $\mathbb Z_2$ which is normalized so that $\mu_2(\mathbb Z_2)=1$