← 研踪 PaperTrailarXiv: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
摘要
Every standard Sturmian word is determined by a directive sequence of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers , where is the length of the -th standard word and , and we show that each nonzero length is attained by exactly one pair . For a purely periodic directive sequence of period we then prove that the number of nonempty palindromic prefixes of length at most satisfies where is the largest eigenvalue of the matrix . For the Fibonacci word this gives , where .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 03:42 · 最新观测版本
Lengths and Counting of Palindromic Prefixes of Standard Sturmian Words
Every standard Sturmian word is determined by a directive sequence of positive integers, and its palindromic prefixes are obtained by iterated palindromic closure. We describe the lengths of these prefixes by the numbers , where is the length of the -th standard word and , and we show that each nonzero length is attained by exactly one pair . For a purely periodic directive sequence of period we then prove that the number of nonempty palindromic prefixes of length at most satisfies where is the largest eigenvalue of the matrix . For the Fibonacci word this gives , where .
查看此版本解读 →查看此版本原文 ↗