Related papers: Projection theorems for intermediate dimensions
An alternate definition of the box-counting dimension is proposed, to provide a better approximation for fractals involving rotation such as the 'Bradley Spiral' structure. A curve fitting comparison of this definition with the box-counting…
We show that the problem whether a given finite metric space can be embedded into $m$-dimensional rectilinear space can be reformulated in terms of the Gromov--Hausdorff distance between some special finite metric spaces.
Given a fractal $\mathcal{I}$ whose Hausdorff dimension matches with the upper-box dimension, we propose a new method which consists in selecting inside $\mathcal{I}$ some subsets (called quasi-Cantor sets) of almost same dimension and with…
We develop the theory of multiresolutions in the context of Hausdorff measure of fractional dimension between 0 and 1. While our fractal wavelet theory has points of similarity that it shares with the standard case of Lebesgue measure on…
Arithmetic progressions of length $3$ may be found in compact subsets of the reals that satisfy certain Fourier -- as well as Hausdorff -- dimensional requirements. It has been shown that a very similar result holds in the integers under…
We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…
A \emph{fractal} is an object exhibiting complexity at arbitrarily small scales. In order to study and characterise fractals, one is often interested in quantifying how they fill up space on small scales. This gives rise to various notions…
We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realization of a fractal…
When performing classification tasks, raw high dimensional features often contain redundant information, and lead to increased computational complexity and overfitting. In this paper, we assume the data samples lie on a single underlying…
It is shown that for every $\e\in (0,1)$, every compact metric space $(X,d)$ has a compact subset $S\subseteq X$ that embeds into an ultrametric space with distortion $O(1/\e)$, and $$\dim_H(S)\ge (1-\e)\dim_H(X),$$ where $\dim_H(\cdot)$…
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…
We study the orthogonal projections of a large class of self-affine carpets, which contains the carpets of Bedford and McMullen as special cases. Our main result is that if $\Lambda$ is such a carpet, and certain natural irrationality…
We apply the theory of Peres and Schlag to obtain estimates for generic Hausdorff dimension distortion under orthogonal projections on simply connected two dimensional Riemannian manifolds of constant curvature. As a conclusion we obtain…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
We prove that for any $E\subset{\Bbb R}^2$, $\dim_{\mathcal{H}}(E)>1$, there exists $x\in E$ such that the Hausdorff dimension of the pinned distance set $$\Delta_x(E)=\{|x-y|: y \in E\}$$ is no less than…
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…
Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and…
We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…
In this note we discuss a common misconception, namely that embeddings are always used to reduce the dimensionality of the item space. We show that when we measure dimensionality in terms of information entropy then the embedding of sparse…
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…