相关论文: Pseudofractals and box counting algorithm
In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…
To any spectral triple (A,D,H) a dimension d is associated, in analogy with the Hausdorff dimension for metric spaces. Indeed d is the unique number, if any, such that |D|^-d has non trivial logarithmic Dixmier trace. Moreover, when d is…
We investigate the distortion of the Assouad dimension and (regularized) spectrum of sets under planar quasiregular maps. While the respective results for the Hausdorff and upper box-counting dimension follow immediately from their…
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…
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,…
Analysis and modeling of networked objects are fundamental pieces of modern data mining. Most real-world networks, from biological to social ones, are known to have common structural properties. These properties allow us to model the growth…
We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension. Let a be any real number greater than or equal to 2 and let b be any non-negative real less than or equal…
In this paper, we study the fractal properties of the boundary of the Cantorval connected with Guthrie-Nymann's series. In particular, we prove that such a Cantorval can be represented as a union of open intervals and a Cantor set having…
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…
In this paper, we present a second partial solution for the problem of cardinality calculation of the set of fractals for its subcategory of the random virtual ones. Consistent with the deterministic case, we show that for the given…
We investigate the box dimensions of compact sets in $\mathbb{R}^2$ that contain a unit distance in every direction (such sets may have zero Hausdorff dimension). Among other results, we show that the lower box dimension must be at least…
Michael Barnsley introduced a family of fractals sets which are repellers of piecewise affine systems. The study of these fractals was motivated by certain problems that arose in fractal image compression but the results we obtained can be…
To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…
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…
Zero-divisors (ZDs) derived by Cayley-Dickson Process (CDP) from N-dimensional hypercomplex numbers (N a power of 2, at least 4) can represent singularities and, as N approaches infinite, fractals -- and thereby,scale-free networks. Any…
While the numerical methods which utilizes partitions of equal-size, including the box-counting method, remain the most popular choice for computing the generalized dimension of multifractal sets, two mass- oriented methods are investigated…
In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming…
In the paper, we define a class of new fractals named ``non-autonomous attractors", which are the generalization of classic Moran sets and attractors of iterated function systems. Simply to say, we replace the similarity mappings by…
We show a new method of estimating the Hausdorff measure (of the proper dimension) of a fractal set from below. The method requires computing the subsequent closest return times of a point to itself.