On the variation of the sum of digits in the Zeckendorf representation: an algorithm to compute the distribution and mixing properties
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929265401921536 |
|---|---|
| author | Hosten, Yohan |
| author_facet | Hosten, Yohan |
| contents | We study probability measures defined by the variation of the sum of digits in the Zeckendorf representation. For $r\ge 0$ and $d\in\mathbb{Z}$, we consider $μ^{(r)}(d)$ the density of integers $n\in\mathbb{N}$ for which the sum of digits increases by $d$ when $r$ is added to $n$. We give a probabilistic interpretation of $μ^{(r)}$ via the dynamical system provided by the odometer of Zeckendorf-adic integers and its unique invariant measure. We give an algorithm for computing $μ^{(r)}$ and we deduce a control on the tail of the negative distribution of $μ^{(r)}$, as well as the formula $μ^{(F_{\ell})} = μ^{(1)}$ where $F_{\ell}$ is a term in the Fibonacci sequence. Finally, we decompose the Zeckendorf representation of an integer $r$ into so-called "blocks" and show that when added to an adic Zeckendorf integer, the successive actions of these blocks can be seen as a sequence of mixing random variables. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_14285 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On the variation of the sum of digits in the Zeckendorf representation: an algorithm to compute the distribution and mixing properties Hosten, Yohan Probability Number Theory 11A63, 11B39, 11K55, 37A25 We study probability measures defined by the variation of the sum of digits in the Zeckendorf representation. For $r\ge 0$ and $d\in\mathbb{Z}$, we consider $μ^{(r)}(d)$ the density of integers $n\in\mathbb{N}$ for which the sum of digits increases by $d$ when $r$ is added to $n$. We give a probabilistic interpretation of $μ^{(r)}$ via the dynamical system provided by the odometer of Zeckendorf-adic integers and its unique invariant measure. We give an algorithm for computing $μ^{(r)}$ and we deduce a control on the tail of the negative distribution of $μ^{(r)}$, as well as the formula $μ^{(F_{\ell})} = μ^{(1)}$ where $F_{\ell}$ is a term in the Fibonacci sequence. Finally, we decompose the Zeckendorf representation of an integer $r$ into so-called "blocks" and show that when added to an adic Zeckendorf integer, the successive actions of these blocks can be seen as a sequence of mixing random variables. |
| title | On the variation of the sum of digits in the Zeckendorf representation: an algorithm to compute the distribution and mixing properties |
| topic | Probability Number Theory 11A63, 11B39, 11K55, 37A25 |
| url | https://arxiv.org/abs/2309.14285 |