科研之友
微信
新浪微博
Facebook
分享链接
摘要
Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as percolation of words. We give a positive answer to their Open Problem 2: almost surely, all words are seen for site percolation on Z(3) with parameter p = 1/2. We also extend this result in various directions, proving the same result on Z(d) , d >= 3, for any value
