English
Related papers

Related papers: Sharp Favard length of random Cantor sets

200 papers

We prove $L^p$ bounds for the maximal operators associated to an Ahlfors-regular variant of fractal percolation. Our bounds improve upon those obtained by I. {\L}aba and M. Pramanik and in some cases are sharp up to the endpoint. A…

Classical Analysis and ODEs · Mathematics 2024-08-19 Pablo Shmerkin , Ville Suomala

Nazarov, Peres and Volberg proved recently that the Favard length of the $n$-th iteration of the four-corner Cantor set is bounded from above by $n^{-c}$ for an appropriate $c$. We generalize this result to all product Cantor sets whose…

Classical Analysis and ODEs · Mathematics 2010-11-02 Izabella Laba , Kelan Zhai

We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realization of a fractal…

Probability · Mathematics 2019-12-23 Yiftach Dayan

We show that when the standard techniques for calculating fractal dimensions in empirical data (such as the box counting) are applied on uniformly random structures, apparent fractal behavior is observed in a range between physically…

Condensed Matter · Physics 2008-02-03 D. A. Lidar , O. Malcai , O. Biham , D. Avnir

We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…

Statistical Mechanics · Physics 2026-04-24 Jiang Zhou , Ziru Deng , Pengcheng Hou

The small-angle scattering (SAS) from the Cantor surface fractal on the plane and Koch snowflake is considered. We develop the construction algorithm for the Koch snowflake, which makes possible the recurrence relation for the scattering…

Statistical Mechanics · Physics 2017-03-10 A. Yu. Cherny , E. M. Anitas , V. A. Osipov , A. I. Kuklin

Projections detect information about the size, geometric arrangement, and dimension of sets. To approach this, one can study the energies of measures supported on a set and the energies for the corresponding pushforward measures on the…

Classical Analysis and ODEs · Mathematics 2024-09-11 Rosemarie Bongers , Krystal Taylor

We prove a lower bound on the first eigenvalue of the fractional Dirichlet-Laplacian of order $s$ on planar open sets, in terms of their inradius and topology. The result is optimal, in many respects. In particular, we recover a classical…

Analysis of PDEs · Mathematics 2024-02-21 Francesca Bianchi , Lorenzo Brasco

A simple, recently observed generalization of the classical Singleton bound to list-decoding asserts that rate $R$ codes are not list-decodable using list-size $L$ beyond an error fraction $\frac{L}{L+1} (1-R)$ (the Singleton bound being…

Information Theory · Computer Science 2024-03-01 Omar Alrabiah , Venkatesan Guruswami , Ray Li

Let $S_\infty=A_\infty\times B_\infty$ be a self-similar product Cantor set in the complex plane, defined via $S_\infty=\bigcup_{j=1}^L T_j(S_\infty)$, where $T_j:\C\to\C$ have the form $T_j(z)=\frac1{L}z+z_j$ and $\{z_1,...,z_L\}=A+iB$ for…

Classical Analysis and ODEs · Mathematics 2012-06-21 Matthew Bond , Izabella Laba , Alexander Volberg

\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…

Dynamical Systems · Mathematics 2015-06-16 Michal Rams , Károly Simon

We define a class of random measures, spatially independent martingales, which we view as a natural generalisation of the canonical random discrete set, and which includes as special cases many variants of fractal percolation and Poissonian…

Classical Analysis and ODEs · Mathematics 2015-02-27 Pablo Shmerkin , Ville Suomala

This work addresses problems on simultaneous Diophantine approximation on fractals, motivated by a long standing problem of Mahler regarding Cantor's middle $1/3$ set. We obtain the first instances where a complete analogue of Khintchine's…

Dynamical Systems · Mathematics 2022-11-11 Osama Khalil , Manuel Luethi

A number of experimental small-angle scattering (SAS) data are characterized by a succession of power-law decays with arbitrarily decreasing values of scattering exponents. To describe such data, here we develop a new theoretical model…

Statistical Mechanics · Physics 2014-07-08 Eugen M. Anitas

We consider spherical averages of the Fourier transform of fractal measures and improve both the upper and lower bounds on the rate of decay. Maximal estimates with respect to fractal measures are deduced for the Schr\"odinger and wave…

Classical Analysis and ODEs · Mathematics 2015-07-31 Renato Lucà , Keith Rogers

In 2011, Guruswami-H{\aa}stad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the…

Information Theory · Computer Science 2016-11-22 Lingfei Jin , Chaoping Xing , Xiande Zhang

The diffraction spectrum of coherent waves scattered from fractal supports is calculated exactly. The fractals considered are of the class generated iteratively by successive dilations and translations, and include generalizations of the…

Condensed Matter · Physics 2009-10-28 Daniel A. Hamburger-Lidar

The methods of determining the fractal dimension and irregularity scale in simulated galaxy catalogs and the application of these methods to the data of the 2dF and 6dF catalogs are analyzed. Correlation methods are shown to be correctly…

Cosmology and Nongalactic Astrophysics · Physics 2014-11-20 Nikita Yu. Lovyagin

We consider a fractal with a variable fractal dimension, which is a generalization of the well known triadic Cantor set. In contrast with the usual Cantor set, the fractal dimension is controlled using a scaling factor, and can vary from…

Statistical Mechanics · Physics 2010-07-02 A. Yu. Cherny , E. M. Anitas , A. I. Kuklin , M. Balasoiu , V. A. Osipov

In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes over $\mathbb F_q$ $\varepsilon$-close to capacity to…

Information Theory · Computer Science 2022-05-04 Nicolas Resch , Chen Yuan