Boundary complexity and surface entropy of 2-multiplicative integer systems on Nd

From MaRDI portal



Abstract: In this article, we introduce the concept of the boundary complexity and prove that for a 2-multiplicative integer system (2-MIS) XOmegap on mathbbN (or on mathbbNd,dgeq2), every point in [h(XOpmega),logr] can be realized as a boundary complexity of a 2-MIS with a specific speed, where r stands for the number of the alphabets. The result is new and quite different from mathbbNd subshifts of finite type (SFT) for dgeq1. Furthermore, the rigorous formula of surface entropy for a mathbbNd 2-MIS is also presented. This provides an efficient method to calculate the topological entropy for mathbbNd 2-MIS and also provides an intrinsic differences between mathbbNd k-MIS and SFTs for dgeq1 and kgeq2.




Cites work









This page was built for publication: Boundary complexity and surface entropy of 2-multiplicative integer systems on Nd

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110664)