Let C-n be the n-th generation in the construction of the middle-half Cantor set. The Cartesian square K-n = C-n x C-n consists of 4(n) squares of side-length 4(-n). The chance that a long needle thrown at random in the unit square will meet K-n is essentially the average length of the projections of K-n, also known as the Favard length of K-n. A classical theorem of Besicovitch implies that the Favard length of K-n tends to zero. It is still an open problem to determine its exact rate of decay. Until recently, the only explicit upper bound was exp(-clog(*) n), due to Peres and Solomyak. (log(*) n is the number of times one needs to take log to obtain a number less than 1 starting from n). In  the power estimate from above was obtained. The exponent in  was less than 1/6 but could have been slightly improved. On the other hand, a simple estimate shows that from below we have the estimate c/n. Here we apply the idea from ,  to show that the estimate from below can be in fact improved to c logn/n. This is in drastic contrast to the case of random Cantor sets studied in .
|Number of pages||9|
|Journal||Mathematical research letters|
|Publication status||Published - Sep 2010|