Related papers: Fractal Intersections and Products via Algorithmic…
This paper surveys work on the relation between fractal dimensions and algorithmic information theory over the past thirty years. It covers the basic development of prefix-free Kolmogorov complexity from an information theoretic point of…
We study algorithmic problems on subsets of Euclidean space of low fractal dimension. These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory. There are several…
The development of algorithmic fractal dimensions in this century has had many fruitful interactions with geometric measure theory, especially fractal geometry in Euclidean spaces. We survey these developments, with emphasis on connections…
We investigate the relationship between algorithmic fractal dimensions and the classical local fractal dimensions of outer measures in Euclidean spaces. We introduce global and local optimality conditions for lower semicomputable outer…
This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…
We examine the dimensions of the intersection of a subset $E$ of an $m$-ary Cantor space $\mathcal{C}^m$ with the image of a subset $F$ under a random isometry with respect to a natural metric. We obtain almost sure upper bounds for the…
This paper concerns the intermediate dimensions, a spectrum of dimensions that interpolate between the Hausdorff and box dimensions. Potential theoretic methods are used to produce dimension bounds for images of sets under H\"older maps and…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
We compute the intrinsic Hausdorff dimension of spacetime at the infrared fixed point of the quantum conformal factor in 4D gravity. The fractal dimension is defined by the appropriate covariant diffusion equation in four dimensions and is…
Most of the known methods for estimating the fractal dimension of fractal sets are based on the evaluation of a single geometric characteristic, e.g. the volume of its parallel sets. We propose a method involving the evaluation of several…
The fractal or Hausdorff dimension is a measure of roughness (or smoothness) for time series and spatial data. The graph of a smooth, differentiable surface indexed in $\mathbb{R}^d$ has topological and fractal dimension $d$. If the surface…
A simple method of calculating the Hausdorff-Besicovitch dimension of the Kronecker Product based fractals is presented together with a compact R script realizing it. The proposed new formula is based on traditionally used values of the…
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set…
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower…
The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. In this work, a modified version of this fractal dimension is presented in order to make it more robust when applied in estimating…
In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or…
In this article, we provide a simple and systematic way to represent general (inhomogeneous) fractals that may look different at different scales and places. By using set-valued compression maps, we express these general fractals as…
The fractal structure of real world objects is often analyzed using digital images. In this context, the compression fractal dimension is put forward. It provides a simple method for the direct estimation of the dimension of fractals stored…
The fractal dimension of a surface allows its degree of roughness to be characterized quantitatively. However, limited effort is attempted to calculate the fractal dimension of surfaces computed from precisely known atomic coordinates from…