...
首页> 外文期刊>Discrete Mathematics And Theoretical Computer Science >Discrete Mathematics & Theoretical Computer Science,Vol 9, No 2 (2007)
【24h】

Discrete Mathematics & Theoretical Computer Science,Vol 9, No 2 (2007)

机译:离散数学与理论计算机科学,第9卷,第2期(2007)

获取原文

摘要

A Parry number is a real number β >1 such thatthe Rényi β-expansion of 1 is finite or infiniteeventually periodic. If this expansion is finite, β is saidto be a simple Parry number.Remind that any Pisot number is a Parry number.In a previous work we have determined the complexity of the fixed point uβ of the canonicalsubstitution associated with β-expansions, when β is a simpleParry number. In this paper we consider the case whereβ is a non-simple Parry number. We determine the structure of infinite leftspecial branches, which are an important tool for the computationof the complexity of uβ. These results allow in particular to obtain thefollowing characterization: the infinite word uβ is Sturmianif and only if β is a quadratic Pisot unit.
机译:Parry数是一个实数β> 1,因此Rényiβ展开1的过程是有限的,或者最终是无限周期性的。如果此扩展是有限的,则称β为简单的Parry数。请记住,任何Pisot数均为Parry数。在先前的工作中,我们确定了与β扩展相关的规范取代的不动点uβ的复杂度,当β是一个简单的帕里编号。在本文中,我们考虑β是非简单帕里数的情况。我们确定无限左特殊分支的结构,这是计算uβ复杂度的重要工具。这些结果尤其允许获得以下特征:无限词uβ为Sturmianif,并且仅当β为二次Pisot单位时。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号