跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20221 · v1

Lengths and Counting of Palindromic Prefixes of Standard Sturmian Words

首次提交 2026-11-16 03:42
版本更新 2026-11-16 03:42
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Every standard Sturmian word cdc_\mathbf{d} is determined by a directive sequence d=(di)i≥1\mathbf{d}=(d_i)_{i\ge 1} of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers j ℓi−1+ℓi−2−2j\,\ell_{i-1}+\ell_{i-2}-2, where ℓn\ell_n is the length of the nn-th standard word and 1≤j≤di1\le j\le d_i, and we show that each nonzero length is attained by exactly one pair (i,j)≠(1,1)(i,j)\neq(1,1). For a purely periodic directive sequence of period kk we then prove that the number πd(N)π_\mathbf{d}(N) of nonempty palindromic prefixes of length at most NN satisfies πd(N)∼d1+⋯+dklog⁡λd log⁡N, π_\mathbf{d}(N)\sim\frac{d_1+\cdots+d_k}{\logλ_\mathbf{d}}\,\log N, where λdλ_\mathbf{d} is the largest eigenvalue of the matrix M(d1)⋯M(dk)M(d_1)\cdots M(d_k). For the Fibonacci word this gives πd(N)∼log⁡N/log⁡φπ_\mathbf{d}(N)\sim\log N/\log\varphi, where φ=(1+5)/2\varphi=(1+\sqrt5)/2.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 03:42 · 最新观测版本

Lengths and Counting of Palindromic Prefixes of Standard Sturmian Words

Every standard Sturmian word cdc_\mathbf{d} is determined by a directive sequence d=(di)i≥1\mathbf{d}=(d_i)_{i\ge 1} of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers j ℓi−1+ℓi−2−2j\,\ell_{i-1}+\ell_{i-2}-2, where ℓn\ell_n is the length of the nn-th standard word and 1≤j≤di1\le j\le d_i, and we show that each nonzero length is attained by exactly one pair (i,j)≠(1,1)(i,j)\neq(1,1). For a purely periodic directive sequence of period kk we then prove that the number πd(N)π_\mathbf{d}(N) of nonempty palindromic prefixes of length at most NN satisfies πd(N)∼d1+⋯+dklog⁡λd log⁡N, π_\mathbf{d}(N)\sim\frac{d_1+\cdots+d_k}{\logλ_\mathbf{d}}\,\log N, where λdλ_\mathbf{d} is the largest eigenvalue of the matrix M(d1)⋯M(dk)M(d_1)\cdots M(d_k). For the Fibonacci word this gives πd(N)∼log⁡N/log⁡φπ_\mathbf{d}(N)\sim\log N/\log\varphi, where φ=(1+5)/2\varphi=(1+\sqrt5)/2.

查看此版本解读 →查看此版本原文 ↗