相关论文: Hausdorff dimension of Graphs of Limit Functions G…

In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function $\rho(n)$ which satisfies certain recurrence relations. As a…

Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…

This article concerns the dimension theory of the graphs of a family of functions which include the well-known 'popcorn function' and its pyramid-like higher-dimensional analogues. We calculate the box and Assouad dimensions of these…

In this article, we investigate the fractal dimension of the graph of the mixed Riemann-Liouville fractional integral for various choice of continuous functions on a rectangular region. We estimate bounds for the box dimension and the…

We construct functions $f \colon [0,1] \to [0,1]$ whose graph as a subset of $\mathbb{R}^2$ has Hausdorff dimension greater than any given value $\alpha \in (1,2)$ but conformal dimension $1$. These functions have the property that a…

We study the dimension theory of limit sets of iterated function systems consisting of a countably infinite number of contractions. Our primary focus is on the intermediate dimensions: a family of dimensions depending on a parameter $\theta…

Previous work has shown that the Hausdorff dimension of sofic affine-invariant sets is expressed as a limit involving intricate matrix products. This limit has typically been regarded as incalculable. However, in several highly non-trivial…

We give upper and lower bounds for the Hausdorff dimensions for a class of graph-directed measures when its underlying directed graph is the infinite N-ary tree. These measures are different from graph-directed self-similar measures driven…

We determine the Hausdorff and box dimension of the fractal graphs for a general class of Weierstrass-type functions of the form $f(x) = \sum_{n=1}^\infty a_n \, g(b_n x + \theta_n)$, where $g$ is a periodic Lipschitz real function and…

We introduce a new concept of dimension for metric spaces, the so-called topological Hausdorff dimension. It is defined by a very natural combination of the definitions of the topological dimension and the Hausdorff dimension. The value of…

The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…

In contrast to the univariate case, several definitions are available for the notion of bounded variation for a bivariate function. This article is an attempt to study the Hausdorff dimension and box dimension of the graph of a continuous…

We provide quantitative estimates for the supremum of the Hausdorff dimension of sets in the real line which avoid $\varepsilon$-approximations of arithmetic progressions. Some of these estimates are in terms of Szemer\'{e}di bounds. In…

This paper contains a comparative study of two families of simple curves drawn in the plane. On the one hand, we have the fractal curves on the unit interval, with self-similar structure, which have associated a Hausdorff dimension. On the…

The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…

We prove that the Hausdorff dimension of the graph of a prevalent continuous function is 2. We also indicate how our results can be extended to the space of continuous functions on $[0,1]^d$ for $d \in \mathbb{N}$ and use this to obtain…

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…

We use the theory of graph limits to study several quasi-random properties, mainly dealing with various versions of hereditary subgraph counts. The main idea is to transfer the properties of (sequences of) graphs to properties of graphons,…

We introduce two frameworks in order to deal with fractal and multi-fractal analysis for subset sum problems where some embedding into the $1$-dimensional Euclidean space plays an important role. As one of these frameworks, the notion of…

Based on the work of Abercrombie, Barnea and Shalev gave an explicit formula for the Hausdorff dimension of a group acting on a rooted tree. We focus here on the binary tree T. Abert and Virag showed that there exist finitely generated (but…