arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.04087math.CO
收藏

斐波那契词密度的动态与程序化分析

Dynamic and Programmatic Analysis of Fibonacci Word Density

Duaa Abdullah, Jasem Hamoud

AI总结:

本文首次研究斐波那契词的密度,通过有限值计算、极限关系和积分方法生成密度函数,并结合编程分析验证结果。

摘要:

斐波那契词是 Sturmian 词的原型,也是词上组合学中研究最多的对象之一。我们研究了斐波那契词的性质,先求出其在有限取值下的密度,再通过计算与一般关系式 $\frac{F(n)}{F(n+1)}$ 相关联的极限得到结果。我们还通过积分关系 $\int_a^b f(x) dx$ 生成了密度函数,其中 $D(n)=\int_a^b f(x) dx$ 且 $f(x) = e^{-x/τ} g(x)$。我们首次给出了斐波那契词密度的研究,并通过编程进行了一些分析。

英文摘要:

Fibonacci word is the archetype of the Sturmian word, and it is one of the most studied of combinatorics on words. We studied the properties of the Fibonacci word and found its density for limited value then by calculating the limit associated with the general relation of $\frac{F(n)}{F(n+1)}$. We also generated the density function through the integral relation of $\int_a^b f(x) dx $ where $D(n)=\int_a^b f(x) dx$ and $f(x) = e^{-x/τ} g(x)$. we presented the first study of the density of the Fibonacci word, in addition to some analysis through programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑