pith. sign in

arxiv: 1812.08022 · v1 · pith:G7O7RWTMnew · submitted 2018-12-19 · 💻 cs.DM · math.CO

On the entropy of coverable subshifts

classification 💻 cs.DM math.CO
keywords covercoversentropyforcesubshiftsconditioncoverablefinite
0
0 comments X
read the original abstract

A coloration w of Z^2 is said to be coverable if there exists a rectangular block q such that w is covered with occurrences of q, possibly overlapping. In this case, q is a cover of w. A subshift is said to have the cover q if each of its points has the cover q. In a previous article, we characterized the covers that force subshifts to be finite (in particular, all configurations are periodic). We also noticed that some covers force subshifts to have zero topological entropy while not forcing them to be finite. In the current paper we work towards characterizing precisely covers which force a subshift to have zero entropy, but not necessarily periodicity. We give a necessary condition and a sufficient condition which are close, but not quite identical.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.