Abstract

We derive a new lower bound pc > 0:8107 for the critical value of Mandelbrot's dyadic fractal percolation model. This is achieved by taking the random fractal set (to be denoted A 1) and adding to it a countable number of straight line segments, chosen in a certain (non-random) way
... read more