Golafshan, M and Mitrofanov, I (2024)

Complexity function of the most significant digits of 2^ND

arXiv:2402.16210.

ISSN/ISBN: Not available at this time. DOI: Not available at this time.

---

• For online information, click here.

---

Abstract: We investigate unipotent dynamics on a torus and apply it to the following problem. Let d be a positive integer. Consider the sequence of digits (w_n), where w_n is the most significant digit in the decimal representation of 2^nd. We prove that the complexity function of the sequence (w_n) is, up to finitely many values, a polynomial.

---

Bibtex:
@misc{golafshan2024complexity, title={Complexity function of the most significant digits of $2^N^D$}, author={Mehdi Golafshan and Ivan Mitrofanov}, year={2024}, eprint={2402.16210}, archivePrefix={arXiv}, primaryClass={math.DS} }

---

Reference Type: Preprint

Subject Area(s): Dynamical Systems, Number Theory

---