当前位置: X-MOL 学术Proc. Am. Math. Soc. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On entropy and intrinsic ergodicity of coded subshifts
Proceedings of the American Mathematical Society ( IF 1 ) Pub Date : 2020-08-05 , DOI: 10.1090/proc/15145
Ronnie Pavlov

Abstract:Any coded subshift $ X_C$ defined by a set $ C$ of code words contains a subshift, which we call $ L_C$, consisting of limits of single code words. We show that when $ C$ satisfies the unique decipherability property, the topological entropy $ h(X_C)$ of $ X_C$ is determined completely by $ h(L_C)$ and the number of code words of each length. More specifically, we show that $ h(X_C) = h(L_C)$ exactly when a certain infinite series is less than or equal to $ 1$, and when that series is greater than $ 1$, we give a formula for $ h(X_C)$. In the latter case, an immediate corollary (using a result from [Israel J. Math. 192 (2012), pp. 785-817] is that $ X_C$ has a unique measure of maximal entropy.


中文翻译:

编码子移位的熵和内在遍历性

摘要:$ X_C $由一组$ C $代码字定义的任何编码子移位都包含一个子移位,我们称此子移位$ L_C $为单个代码字的限制。我们表明,当$ C $满足唯一可译码性能,拓扑熵$ h(X_C)$$ X_C $完全由确定$ h(L_C)$和各自的长度的码字的数目。更具体地说,我们证明了当某个无限级数小于或等于时,以及当该级数大于时,我们给出的公式。在后一种情况下,直接推论(使用来自[Israel J. Math。192(2012),第785-817页的结果])具有唯一的最大熵度量。 $ h(X_C)= h(L_C)$$ 1 $$ 1 $$ h(X_C)$$ X_C $
更新日期:2020-09-02
down
wechat
bug