Bratteli-Vershik系统的周期编码

IF 0.3 4区数学 Q4 MATHEMATICS

Mathematica Scandinavica Pub Date : 2018-12-13 DOI:10.7146/math.scand.a-117570

S. Frick, K. Petersen, Sandi Shields

{"title":"Bratteli-Vershik系统的周期编码","authors":"S. Frick, K. Petersen, Sandi Shields","doi":"10.7146/math.scand.a-117570","DOIUrl":null,"url":null,"abstract":"We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a periodic sequence. This is a step toward understanding when a Bratteli-Vershik system can be essentially faithfully represented by means of a natural coding as a subshift on a finite alphabet.","PeriodicalId":49873,"journal":{"name":"Mathematica Scandinavica","volume":" ","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2018-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Periodic codings of Bratteli-Vershik systems\",\"authors\":\"S. Frick, K. Petersen, Sandi Shields\",\"doi\":\"10.7146/math.scand.a-117570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a periodic sequence. This is a step toward understanding when a Bratteli-Vershik system can be essentially faithfully represented by means of a natural coding as a subshift on a finite alphabet.\",\"PeriodicalId\":49873,\"journal\":{\"name\":\"Mathematica Scandinavica\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2018-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematica Scandinavica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.7146/math.scand.a-117570\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematica Scandinavica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7146/math.scand.a-117570","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

根据初始路径段是周期性的，我们给出了brattelli - vershik系统编码的条件，等价于一个构造符号递归方案对应于一个切割和堆叠过程来产生周期序列。这是理解brattelli - vershik系统何时可以通过自然编码作为有限字母表上的子移位本质上忠实地表示的一步。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Periodic codings of Bratteli-Vershik systems

We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a periodic sequence. This is a step toward understanding when a Bratteli-Vershik system can be essentially faithfully represented by means of a natural coding as a subshift on a finite alphabet.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Mathematica Scandinavica 数学-数学

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Mathematica Scandinavica is a peer-reviewed journal in mathematics that has been published regularly since 1953. Mathematica Scandinavica is run on a non-profit basis by the five mathematical societies in Scandinavia. It is the aim of the journal to publish high quality mathematical articles of moderate length. Mathematica Scandinavica publishes about 640 pages per year. For 2020, these will be published as one volume consisting of 3 issues (of 160, 240 and 240 pages, respectively), enabling a slight increase in article pages compared to previous years. The journal aims to publish the first issue by the end of March. Subsequent issues will follow at intervals of approximately 4 months. All back volumes are available in paper and online from 1953. There is free access to online articles more than five years old.