Dynamical behavior of alternate base expansions

02/17/2021
by   Émilie Charlier, et al.
0

We generalize the greedy and lazy β-transformations for a real base β to the setting of alternate bases β=(β_0,…,β_p-1), which were recently introduced by the first and second authors as a particular case of Cantor bases. As in the real base case, these new transformations, denoted T_β and L_β respectively, can be iterated in order to generate the digits of the greedy and lazy β-expansions of real numbers. The aim of this paper is to describe the dynamical behaviors of T_β and L_β. We first prove the existence of a unique absolutely continuous (with respect to an extended Lebesgue measure, called the p-Lebesgue measure) T_β-invariant measure. We then show that this unique measure is in fact equivalent to the p-Lebesgue measure and that the corresponding dynamical system is ergodic and has entropy 1/plog(β_p-1⋯β_0). We then express the density of this measure and compute the frequencies of letters in the greedy β-expansions. We obtain the dynamical properties of L_β by showing that the lazy dynamical system is isomorphic to the greedy one. We also provide an isomorphism with a suitable extension of the β-shift. Finally, we show that the β-expansions can be seen as (β_p-1⋯β_0)-representations over general digit sets and we compare both frameworks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2021

Expansions in Cantor real bases

We introduce and study series expansions of real numbers with an arbitra...
research
02/01/2022

Combinatorial properties of lazy expansions in Cantor real bases

The lazy algorithm for a real base β is generalized to the setting of Ca...
research
04/19/2023

Rate of convergence of Thresholding Greedy Algorithms

The rate of convergence of the classical Thresholding Greedy Algorithm w...
research
02/21/2023

Rewriting rules for arithmetics in alternate base systems

For alternate Cantor real base numeration systems we generalize the resu...
research
10/06/2020

The Base Measure Problem and its Solution

Probabilistic programming systems generally compute with probability den...
research
06/27/2020

Generic Transformations Have Zero Lower Slow Entropy and Infinite Upper Slow Entropy

The notion of slow entropy, both upper and lower slow entropy, were defi...
research
09/27/2020

Non-Archimedean dynamics of the complex shift

An (asynchronous) automaton transformation of one-sided infinite words o...

Please sign up or login with your details

Forgot password? Click here to reset