Normality in non-integer bases and polynomial time randomness

• Autores: Almarza, Javier Ignacio; Figueira, Santiago
• Año de publicación: 2015
• Idioma: inglés
• Tipo de recurso: artículo
• Materia: Algorithmic Randomness; Deterministic Finite Automaton; Subshift; Pisot Number; Normality; Polynomial Randomness; Martingale
• Institución: Consejo Nacional de Investigaciones Científicas y Técnicas

It is known that if x ∈ [0, 1] is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of x) then x is normal in any integer base greater than one. We show that if x is polynomial time random and β > 1 is Pisot, then x is “normal in base β”, in the sense that the sequence (xβn)n∈N is uniformly distributed modulo one. We work with the notion of P-martingale, a generalization of martingales to non-uniform distributions, and show that a sequence over a finite alphabet is distributed according to an irreducible, invariant Markov measure P if an only if no P-martingale whose betting factors are computed by a deterministic finite automaton succeeds on it. This is a generalization of Schnorr and Stimm’s characterization of normal sequences in integer bases. Our results use tools and techniques from symbolic dynamics, together with automata theory and algorithmic randomness.
Fil: Almarza, Javier Ignacio. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Matemática; Argentina
Fil: Figueira, Santiago. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina