相关论文: The box dimension of random box-like self-affine s…

We investigate the dimension theory of inhomogeneous self-affine carpets. Through the work of Olsen, Snigireva and Fraser, the dimension theory of inhomogeneous self-similar sets is now relatively well-understood, however, almost no…

We consider a class of "box-like" statistically self-affine functions, and compute the almost-sure box-counting dimension of their graphs. Furthermore, we consider the differentiability of our functions, and prove that, depending on an…

We consider a class of planar self-affine sets which we call "box-like". A box-like self-affine set is the attractor of an iterated function system (IFS) of affine maps where the image of the unit square, [0,1]^2, under arbitrary…

We prove that the upper box dimension of an inhomogeneous self-affine set is bounded above by the maximum of the affinity dimension and the dimension of the condensation set. In addition, we determine sufficient conditions for this upper…

The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…

Iterated function systems (IFSs) are one of the most important tools for building examples of fractal sets exhibiting some kind of `approximate self-similarity'. Examples include self-similar sets, self-affine sets etc. A beautiful variant…

In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…

Using methods from ergodic theory along with properties of the Furstenberg measure we obtain conditions under which certain classes of plane self-affine sets have Hausdorff or box-counting dimensions equal to their affinity dimension. We…

We extend the results previously published on exact packing dimensions of random recursive constructions to include constructions satisfying commonly occurring conditions. We remove the restrictive assumption that the diameter reduction…

In this article we investigate the pressure function and affinity dimension for iterated function systems associated to the "box-like" self-affine fractals investigated by D.-J. Feng, Y. Wang and J.M. Fraser. Combining previous results of…

We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…

We study the box dimensions of self-affine sets in $\mathbb{R}^3$ which are generated by a finite collection of generalised permutation matrices. We obtain bounds for the dimensions which hold with very minimal assumptions and give rise to…

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…

The class of stochastically self-similar sets contains many famous examples of random sets, e.g. Mandelbrot percolation and general fractal percolation. Under the assumption of the uniform open set condition and some mild assumptions on the…

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…

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…

We prove a packing exponent formula for the upper box-counting dimension of attractors of certain projective iterated function systems. This partially affirms a conjecture of De Leo, and gives that the box-counting dimension of the Rauzy…

We prove that for random affine code tree fractals the affinity dimension is almost surely equal to the unique zero of the pressure function. As a consequence, we show that the Hausdorff, packing and box counting dimensions of such systems…

We investigate the box-counting dimension of the image of a set $E \subset \mathbb{R}$ under a random multiplicative cascade function $f$. The corresponding result for Hausdorff dimension was established by Benjamini and Schramm in the…

In this paper, we answer a question of Nussbaum, Priyadarshi, and Lunel [Positive operators and Hausdorff dimension of invariant sets, Trans. Amer. Math. Soc. 364(2) (2012) 1029-1066.]. We also show that the Hausdorff dimension and box…