Density Characterization with The Upper Bound of Density of Fibonacci Word
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917047219257344 |
|---|---|
| author | Abdullah, Duaa Hamoud, Jasem |
| author_facet | Abdullah, Duaa Hamoud, Jasem |
| contents | This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote the units digit. Through analysis of these ratios and their convergence to powers of $φ$, we illustrate the intrinsic exponential growth rates characteristic of Fibonacci words. By considering the natural density concept for sets of positive integers, it is demonstrated that the density of Fibonacci words approaches unity, correlating with classical results on Fibonacci number distributions as \[ \operatorname{DF}(F_k) <\frac{m(m+1)}{n(2m-n+1)}. \] Furthermore, generating functions and combinatorial formulas for general terms of Fibonacci words are derived, linking polynomial expressions and limit behaviors integral to their combinatorial structure. The study is supplemented by numerical data and graphical visualization, confirming theoretical findings and providing insights into the early transient and asymptotic behavior of Fibonacci word densities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_00886 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Density Characterization with The Upper Bound of Density of Fibonacci Word Abdullah, Duaa Hamoud, Jasem Combinatorics 05C42, 11B05, 11R45, 11B39 G.2.0; F.2.2 This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote the units digit. Through analysis of these ratios and their convergence to powers of $φ$, we illustrate the intrinsic exponential growth rates characteristic of Fibonacci words. By considering the natural density concept for sets of positive integers, it is demonstrated that the density of Fibonacci words approaches unity, correlating with classical results on Fibonacci number distributions as \[ \operatorname{DF}(F_k) <\frac{m(m+1)}{n(2m-n+1)}. \] Furthermore, generating functions and combinatorial formulas for general terms of Fibonacci words are derived, linking polynomial expressions and limit behaviors integral to their combinatorial structure. The study is supplemented by numerical data and graphical visualization, confirming theoretical findings and providing insights into the early transient and asymptotic behavior of Fibonacci word densities. |
| title | Density Characterization with The Upper Bound of Density of Fibonacci Word |
| topic | Combinatorics 05C42, 11B05, 11R45, 11B39 G.2.0; F.2.2 |
| url | https://arxiv.org/abs/2509.00886 |