Successor Rigidity and Complexity Spectra in Ostrowski Numeration Systems
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901733114904576 |
|---|---|
| author | Wang, Jianming |
| author_facet | Wang, Jianming |
| contents | <p>\begin{abstract}<br>We study Hamming distances between consecutive canonical expansions in quadratic Ostrowski-type numeration systems, with the Zeckendorf and metallic-mean cases as the two concrete families developed here in full detail. The paper is organized around two concrete theories and an abstract transfer framework. In Part~I we treat the Zeckendorf case,<br>\[<br>C(n)=\hdist\bigl(\rep_{\varphi}(n),\rep_{\varphi}(n+1)\bigr),<br>\]<br>and develop a complete concrete account of: local successor rewriting, an affine identity with the Zeckendorf sum-of-digits function, exact prefix sums, Fibonacci block self-similarity, exact finite-interval recurrences, superlevel counts, limiting laws, and a symbolic-dynamical interpretation via the Parry measure of the golden mean shift. In Part~II we extend the same program to the metallic-mean family attached to the quadratic irrationals<br>\[<br>\mu_a=\frac{a+\sqrt{a^2+4}}{2},\qquad a\ge 1.<br>\]<br>For the canonical $(a,1)$-recurrence numeration we prove a complete local successor rewriting rule, establish the exact affine formula<br>\[<br> a\,C_a(n)=a+1+s_a(n)-s_a(n+1),<br>\]<br>obtain the global prefix-sum identity<br>\[<br>\sum_{n=0}^{N-1}C_a(n)=\frac{(a+1)N-s_a(N)}{a},<br>\]<br>show that the mean Hamming cost tends to $1+1/a$, and derive exact block-copy theorems on canonical metallic intervals. We further prove an exact recurrence and a closed formula for the metallic superlevel counts, identify the maximal-jump multiplicities, and deduce an explicit limiting distribution with rational probability generating function. The two concrete parts therefore furnish a complete Zeckendorf theory together with its first nonbinary quadratic extension.<br>The final part extracts the common mechanism behind these two families into a quadratic-Ostrowski transfer framework. Local terminal rewriting, affine digit-statistic control, and canonical-interval decomposition appear there as structural inputs already verified in the concrete arguments. At the abstract level we prove a bridge theorem showing that, once the tail generating functions themselves are carried by a finite transfer package whose tail part is spectrally subcritical relative to block growth, rationality of the limiting law, exponential tails, exponential integrability, and moment convergence follow simultaneously from the same finite-state input. We also isolate a more native transfer criterion phrased directly in terms of successor-normalization templates and stationary canonical-block substitutions, so that the framework reaches beyond the Zeckendorf and metallic families to a broader class of purely periodic quadratic Ostrowski systems satisfying these finite-state hypotheses. Under a further transfer-primitivity assumption, one moreover obtains Perron--Frobenius type spectral control and exponential convergence for each fixed superlevel statistic.<br>\end{abstract}</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_19626355 |
| institution | Zenodo |
| language | eng |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Successor Rigidity and Complexity Spectra in Ostrowski Numeration Systems Wang, Jianming Zeckendorf expansion; metallic mean; Hamming distance; Ostrowski numeration; digit sum; quadratic irrational. <p>\begin{abstract}<br>We study Hamming distances between consecutive canonical expansions in quadratic Ostrowski-type numeration systems, with the Zeckendorf and metallic-mean cases as the two concrete families developed here in full detail. The paper is organized around two concrete theories and an abstract transfer framework. In Part~I we treat the Zeckendorf case,<br>\[<br>C(n)=\hdist\bigl(\rep_{\varphi}(n),\rep_{\varphi}(n+1)\bigr),<br>\]<br>and develop a complete concrete account of: local successor rewriting, an affine identity with the Zeckendorf sum-of-digits function, exact prefix sums, Fibonacci block self-similarity, exact finite-interval recurrences, superlevel counts, limiting laws, and a symbolic-dynamical interpretation via the Parry measure of the golden mean shift. In Part~II we extend the same program to the metallic-mean family attached to the quadratic irrationals<br>\[<br>\mu_a=\frac{a+\sqrt{a^2+4}}{2},\qquad a\ge 1.<br>\]<br>For the canonical $(a,1)$-recurrence numeration we prove a complete local successor rewriting rule, establish the exact affine formula<br>\[<br> a\,C_a(n)=a+1+s_a(n)-s_a(n+1),<br>\]<br>obtain the global prefix-sum identity<br>\[<br>\sum_{n=0}^{N-1}C_a(n)=\frac{(a+1)N-s_a(N)}{a},<br>\]<br>show that the mean Hamming cost tends to $1+1/a$, and derive exact block-copy theorems on canonical metallic intervals. We further prove an exact recurrence and a closed formula for the metallic superlevel counts, identify the maximal-jump multiplicities, and deduce an explicit limiting distribution with rational probability generating function. The two concrete parts therefore furnish a complete Zeckendorf theory together with its first nonbinary quadratic extension.<br>The final part extracts the common mechanism behind these two families into a quadratic-Ostrowski transfer framework. Local terminal rewriting, affine digit-statistic control, and canonical-interval decomposition appear there as structural inputs already verified in the concrete arguments. At the abstract level we prove a bridge theorem showing that, once the tail generating functions themselves are carried by a finite transfer package whose tail part is spectrally subcritical relative to block growth, rationality of the limiting law, exponential tails, exponential integrability, and moment convergence follow simultaneously from the same finite-state input. We also isolate a more native transfer criterion phrased directly in terms of successor-normalization templates and stationary canonical-block substitutions, so that the framework reaches beyond the Zeckendorf and metallic families to a broader class of purely periodic quadratic Ostrowski systems satisfying these finite-state hypotheses. Under a further transfer-primitivity assumption, one moreover obtains Perron--Frobenius type spectral control and exponential convergence for each fixed superlevel statistic.<br>\end{abstract}</p> |
| title | Successor Rigidity and Complexity Spectra in Ostrowski Numeration Systems |
| topic | Zeckendorf expansion; metallic mean; Hamming distance; Ostrowski numeration; digit sum; quadratic irrational. |
| url | https://doi.org/10.5281/zenodo.19626355 |