arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0109208math.DS
收藏

Complexity and growth for polygonal billiards

J. Cassaigne, P. Hubert, S. Troubetzkoy

英文摘要:

We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the complexity has cubic asymptotic growth.

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

↑