Related papers: On the dimension theory of Okamoto's function
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent…
In this article we derive a formula for the Hausdorff dimension of Besicovitch-Eggleston level sets associated with non-autonomous dynamics constructed from families of countable affine iterated function systems. The formula obtained shows…
The set B of geodesic rays avoiding a suitable obstacle in a complete negatively curved Riemannian manifold determines a spectrum S. While various properties of this spectrum are known, we define and study dimension functions on S in terms…
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
We study the multifractal analysis for smooth dynamical systems in dimension one. It is characterized the Hausdorff dimension of the level set obtained from the Birkhoff averages of a continuous function by the local dimensions of…
We fix a positive integer $M$, and we consider expansions in arbitrary real bases $q>1$ over the alphabet $\{0,1,...,M\}$. We denote by $U_q$ the set of real numbers having a unique expansion. Completing many former investigations, we give…
Using McMullen's Hausdorff dimension algorithm, we study numerically the dimension of the limit set of groups generated by reflections along three geodesics on the hyperbolic plane. Varying these geodesics, we found four minima in the…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
We introduce and study the \emph{Fourier spectrum} which is a continuously parametrised family of dimensions living between the Fourier dimension and the Hausdorff dimension for both sets and measures. We establish some fundamental theory…
This paper is about lower and upper bounds for the Hausdorff dimension of the level and collision sets of a class of Feller processes. Our approach is motivated by analogous results for L\'evy processes by Hawkes (for level sets), Taylor…
We use the upper and lower potential functions and Bowen's formula estimating the Hausdorff dimension of the limit set of a regular semigroup generated by finitely many $C^{1+\alpha}$-contracting mappings. This result is an application of…
We prove that for every at most countable family $\{f_k(x)\}$ of real functions on $[0,1)$ there is a single-valued real function $F(x)$, $x\in[0,1)$, such that the Hausdorff dimension of the graph $\Gamma$ of $F(x)$ equals 2, and for every…
In this paper, we study the Hausdorff dimension of self-similar measures and sets on the real line, where the generating iterated function system consists of some maps that share the same fixed point. In particular, we will show that out of…
In this article we aim to investigate the Hausdorff dimension of the set of points $x \in [0,1)$ such that for any $r\in\mathbb{N},$ \begin{align*} a_{n+1}(x)a_{n+2}(x)\cdots a_{n+r}(x)\geq e^{\tau(x)(h(x)+\cdots+h(T^{n-1}(x)))} {align*}…
A theoretical approach to computing the Hausdorff dimension of the topological boundary of attractors of iterated function systems is developed. The curve known as the L\'evy Dragon is then studied in detail and the Hausdorff dimension of…
It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…
We study the iteration of functions in the exponential family. We construct a number of sets, consisting of points which escape to infinity `slowly', and which have Hausdorff dimension equal to 1. We prove these results by using the idea of…
The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…
We introduce a continuum of dimensions which are `intermediate' between the familiar Hausdorff and box dimensions. This is done by restricting the families of allowable covers in the definition of Hausdorff dimension by insisting that $|U|…