Complexity of Leading Digit Sequences
From MaRDI portal
Publication:5130749
DOI10.23638/DMTCS-22-1-14zbMath1456.11135arXiv1804.00221MaRDI QIDQ5130749
Yunyi Zhang, Xinwei He, Yuchen Li, Adolf Hildebrand
Publication date: 28 October 2020
Full work available at URL: https://arxiv.org/abs/1804.00221
Related Items (1)
Cites Work
- Behavior of various complexity functions
- Strings of first digits of powers of a number
- String patterns of leading digits
- The distribution of leading digits and uniform distribution mod 1
- Complexity and special factors
- Complexity of sequences and dynamical systems
- Three distance theorems and combinatorics on words
- Coding rotations on intervals
- Benford’s law for coefficients of modular forms and partition functions
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
- Représentation géométrique de suites de complexité $2n+1$
- A Complexity Measure
- A local Benford Law for a class of arithmetic sequences
- Complexity of infinite words associated with beta-expansions
- The Significant-Digit Phenomenon
- Fast growing sequences of numbers and the first digit phenomenon
- An Introduction to Benford's Law
- Benford's Law
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of Leading Digit Sequences
