Related papers: Estimating the Hausdorff measure by recurrence

We study the problem of reconstructing a convex body using only a finite number of measurements of outer normal vectors. More precisely, we suppose that the normal vectors are measured at independent random locations uniformly distributed…

A representation of frequency of strings of length K in complete genomes of many organisms in a square has led to seemingly self-similar patterns when K increases. These patterns are caused by under-represented strings with a certain…

The area-perimeter scaling can be employed to evaluate the fractal dimension of urban boundaries. However, the formula in common use seems to be not correct. By means of mathematical method, a new formula of calculating the boundary…

We establish a formula yielding the Hausdorff measure for a class of non-self-similar Cantor sets in terms of the canonical covers of the Cantor set.

We consider linear mappings on the $d$-dimensional torus, defined by $T(x) = Ax \pmod 1$, where $A$ is an invertible $d \times d$ integer matrix, with no eigenvalues on the unit circle. In the case $d = 2$ and $\det A = \pm 1$, we give a…

We present a detailed Hausdorff dimension analysis of the set of real numbers where the product of consecutive partial quotients in their continued fraction expansion grow at a certain rate but the growth of the single partial quotient is…

A new similarity measure for two sets of S-parameters is proposed. It is constructed with the modified Hausdorff distance applied to S-parameter points in 3D space with real, imaginary and normalized frequency axes. New S-parameters…

We study fractal measures on Euclidean space through the dynamics of "zooming in" on typical points. The resulting family of measures (the "scenery"), can be interpreted as an orbit in an appropriate dynamical system which often…

For measure preserving dynamical systems on metric spaces we study the time needed by a typical orbit to return back close to its starting point. We prove that when the decay of correlation is super-polynomial the recurrence rates and the…

We solve the problem of giving sharp asymptotic bounds on the Hausdorff dimensions of certain sets of badly approximable matrices, thus improving results of Broderick and Kleinbock (preprint 2013) as well as Weil (preprint 2013), and…

This article deals with the estimation of fractal dimension of spatio-temporal patterns that are generated by numerically solving the Swift Hohenberg (SH) equation. The patterns were converted into a spatial series (analogous to time…

Let $T\colon\mathbb{T}^d\to \mathbb{T}^d$, defined by $T x=Ax(\bmod 1)$, where $A$ is a $d\times d$ integer matrix with eigenvalues $1<|\lambda_1|\le|\lambda_2|\le\dots\le|\lambda_d|$. We investigate the Hausdorff dimension of the…

Let $\theta$ be an irrational number and $\varphi: {\mathbb N} \to {\mathbb R}^{+}$ be a monotone decreasing function tending to zero. Let $$E_\varphi(\theta) =\Big\{y \in \mathbb R: \|n\theta- y\|<\varphi(n), \ {\text{for infinitely…

We compute the exact Hausdorff and Packing measures of linear Cantor sets which might not be self similar or homogeneous . The calculation is based on the local behavior of the natural probability measure supported on the sets.

We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural…

We consider systems of multiple Brownian particles in one dimension that repel mutually via a logarithmic potential on the real line, more specifically the Dyson model. These systems are characterized by a parameter that controls the…

The concept of fractal index is introduced in connection with the idea of universal class $h$ of particles or quasiparticles, termed fractons, which obey fractal statistics. We show the relation between fractons and conformal field…

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…

The Hausdorff distance (HD) is a robust measure of set dissimilarity, but computing it exactly on large, high-dimensional datasets is prohibitively expensive. We propose \textbf{ProHD}, a projection-guided approximation algorithm that…