【24h】

On Palindromic Length of Sturmian Sequences

机译:Sturmian序列的回文长度

获取原文

摘要

Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word u we study palu, that is, the function that assigns to each positive integer n, the maximal palindromic length of factors of length n in u. Recently, Frid (2018) proved that lim sup_(n→∞) pal_u (n) = +∞ for any Sturmian word u. We show that there is a constant K > 0 such that palu (n) ≤ K In n for every Sturmian word w, and that for each non-decreasing function f with property lim_(n→∞) f(n) = +∞ there is a Sturmian word u such that pal_u(n) =O(f(n)).
机译:Frid,Puzynina和Zamboni(2013)将有限字w的回文长度定义为级联等于w的最小回文数。对于无限大的单词u,我们研究palu,即分配给每个正整数n的函数,即u中长度为n的因子的最大回文长度。最近,弗里德(Frid)(2018)证明,对于任何Sturmian单词u,lim sup_(n→∞)pal_u(n)= +∞。我们证明存在一个常数K> 0,使得每个Sturmian单词w的palu(n)≤K In n,以及每个具有lim_(n→∞)f(n)= +∞属性的非递减函数f有一个Sturmian单词u,使得pal_u(n)= O(f(n))。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号