Approximating the Hard Square Entropy Constant with Probabilistic Methods

Details Approximating the Hard Square Entropy Constant with Probabilistic Methods Approximating the Hard Square Entropy Constant with Probabilistic Methods

2010-11-09

arxiv.org/abs/1011.1983v1

Mathematics

Dynamical Systems

30 pages, 5 figures, submitted

Scientific paper

For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X. It is always the case that the sequence h(H_n(X))/n of normalized topological entropies of the strip shifts approaches h(X), the topological entropy of X. In this paper, we use probabilistic methods from interacting particle systems to show that for the two-dimensional hard square shift H, in fact h(H_{n+1}(H)) - h(H_n(H)) also approaches h(H), and the rate of convergence is at least exponential. A consequence of this is that h(H) is computable to any tolerance 1/n in time polynomial in n. We also give an example of a two-dimensional block gluing nearest neighbor shift of finite type Y for which h(H_{n+1}(Y)) - h(H_n(Y)) does not even approach a limit.

Affiliated with

Also associated with

No associations

Rating

Approximating the Hard Square Entropy Constant with Probabilistic Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating the Hard Square Entropy Constant with Probabilistic Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the Hard Square Entropy Constant with Probabilistic Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492704