Related papers: Fractal dimensions of $k$-automatic sets
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…
Hausdorff dimension of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections" "network" corresponding to a fractal set, $F$. This lead to the definition of the…
The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…
Fractal nests are sets defined as unions of unit $n$-spheres scaled by a sequence of $k^{-\alpha}$ for some $\alpha>0$. In this article we generalise the concept to subsets of such spheres and find the formulas for their box counting…
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…
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…
Fibonacci word fractals are a class of fractals that have been studied recently, though the word they are generated from is more widely studied in combinatorics. The Fibonacci word can be used to draw a curve which possesses…
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…
We determine the Hausdorff, packing and box-counting dimension of a family of self-affine sets generalizing Bara\'nski carpets. More specifically, we fix a Bara\'nski system and allow both vertical and horizontal random translations, while…
This paper presents a comprehensive introduction to the Hausdorff measure, a fundamental tool in fractal geometry and geometric measure theory. We begin by defining the Hausdorff outer measure on subsets of metric spaces, followed by a…
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…
In this work we are interested in the self--affine fractals studied by Gatzouras and Lalley and by the author which generalize the famous general Sierpinski carpets studied by Bedford and McMullen. We give a formula for the Hausdorff…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We consider the fractal characteristic of the quantum mechanical paths and we obtain for any universal class of fractons labeled by the Hausdorff dimension defined within the interval 1$ $$ < $$ $$h$$ $$ <$$ $$ 2$, a fractal distribution…
In this work, we aim to advance the development of a fractal theory for sets of integers. The core idea is to utilize the fractal structure of $p$-adic integers, where $p$ is a prime number, and compare this with conventional densities and…
Using Voiculescu's notion of a matricial microstate we introduce fractal dimensions and entropies for finite sets of selfadjoint operators in a tracial von Neumann algebra. We show that they possess properties similar to their classical…
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…
In this paper, we discuss the Higuchi algorithm which serves as a widely used estimator for the box-counting dimension of the graph of a bounded function $f : [0,1] \to \R$. We formulate the method in a mathematically precise way and show…
Mean Hausdorff dimension is a dynamical version of Hausdorff dimension. It provides a way to dynamicalize geometric measure theory. We pick up the following three classical results of fractal geometry. (1) The calculation of Hausdorff…
We study the Hausdorff and box-counting dimensions of cookie-cutter-like sets formed by sequential dynamics of a finite number of expanding maps. Under some natural conditions, these dimensions turn out to be the minimum and maximum of the…