Embedding binary sequences into Bernoulli site percolation on Z^3

Abstract: We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on

m a t h b b Z^{d}

with parameter

p

, known also as percolation of words. In 1995, I. Benjamini and H. Kesten proved that, for

d g e q 10

and

p = 1 / 2

, all sequences can be embedded, almost surely. They conjectured that the same should hold for

d g e q 3

. In this paper we consider

d g e q 3

and

p i n (p_{c} (d), 1 - p_{c} (d))

, where

p_{c} (d) < 1 / 2

is the critical threshold for site percolation on

m a t h b b Z^{d}

. We show that there exists an integer

M = M (p)

, such that, a.s., every binary sequence, for which every run of consecutive {0s} or {1s} contains at least

M

digits, can be embedded.

Recommendations

Cites Work

Cited In (4)

This page was built for publication: Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\)