Related papers: Sharp Favard length of random Cantor sets

In this paper, we study the Favard length of some random Cantor sets of Hausdorff dimension 1. We start with a unit disk in the plane and replace the unit disk by $4$ disjoint subdisks (with equal distance to each other) of radius $1/4$…

Given a set in the plane, the average length of its projections over all directions is called Favard length. This quantity measures the size of a set, and is closely related to metric and geometric properties of the set such as…

In this article, we consider the concept of the decay of the Favard length of $\varepsilon$-neighborhoods of purely unrectifiable sets. We construct non-self-similar Cantor sets for which the Favard length decays arbitrarily with respect to…

The Favard length of a subset of the plane is defined as the average of its orthogonal projections. This quantity is related to the probabilistic Buffon needle problem; that is, the Favard length of a set is proportional to the probability…

We prove a power law for the asymptotic decay of the Favard length of neighbourhoods of certain self-similar sets in $\mathbb{R}^d$ with $d \geq 2$. These self-similar sets are generalizations of the so-called four-corner Cantor set to…

In this paper we get an estimate of Favard length of an arbitrary neighbourhood of an arbitrary self-similar Cantor set. Consider $L$ closed disjoint discs of radius $1/L$ inside the unit disc. By using linear maps of smaller disc onto the…

We consider a model of randomness for self-similar Cantor sets of finite and positive $1$-Hausdorff measure. We find the sharp rate of decay of the probability that a Buffon needle lands $\delta$-close to a Cantor set of this particular…

The Favard length of a Borel set $E\subset\mathbb{R}^2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This…

We improve a special case of the Lam-Leung lower bound on the number of elements in a vanishing sum of $N$-th roots of unity. Using this result, we extend the Favard length estimates due to Bond, {\L}aba, and Volberg to a new class of…

Let $E \subset B(1) \subset \mathbb R^{2}$ be an $\mathcal{H}^{1}$ measurable set with $\mathcal{H}^{1}(E) < \infty$, and let $L \subset \mathbb R^{2}$ be a line segment with $\mathcal{H}^{1}(L) = \mathcal{H}^{1}(E)$. It is not hard to see…

We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that,…

Multiple resolution analysis of two dimensional structures composed of randomly adsorbed penetrable rods, for densities below the percolation threshold, has been carried out using box-counting functions. It is found that at relevant…

We continue our investigation of the fractal uncertainty principle (FUP) for random fractal sets. In the prequel (arXiv:2107.08276), we considered the Cantor sets in the discrete setting with alphabets randomly chosen from a base of digits…

We survey some of our recent results on the geometry of spatially independent martingales, in a more concrete setting that allows for shorter, direct proofs, yet is general enough for several applications and contains the well-known fractal…

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

We prove that the fractal dimension of a metric space equipped with an Ahlfors regular measure can be recovered from the persistent homology of random samples. Our main result is that if $x_1,\ldots, x_n$ are i.i.d. samples from a…

In this paper, we are interested in the problem of scattering by strictly convex obstacles in the plane. We provide an upper bound for the number $N(r,\gamma)$ of resonances in the box $\{r \le \Re(\lambda) \le r + 1$; $\Im(\lambda) \ge -…

Singular vectors are those for which the quality of rational approximations provided by Dirichlet's Theorem can be improved by arbitrarily small multiplicative constants. We provide an upper bound on the Hausdorff dimension of singular…

We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous…

Let $\Cant_n$ be the $n$-th generation in the construction of the middle-half Cantor set. The Cartesian square $\K_n = \Cant_n \times \Cant_n$ consists of $4^n$ squares of side-length $4^{-n}$. The chance that a long needle thrown at random…