Related papers: Pinned Distance Sets Using Effective Dimension

Let $I=[0,1)$, $-1<\lambda<1$ and $f\colon I\to I$ be a piecewise $\lambda$-affine map of the interval $I$, i.e., there exist a partition $0=a_0<a_1<\cdots< a_{k-1}<a_k=1$ of the interval $I$ into $k\geq2$ subintervals and $b_1,\ldots,…

Let $S \subset {\mathbb R}^d$ be contained in the unit ball. Let $\Delta(S)=\{||a-b||:a,b \in S\}$, the Euclidean distance set of $S$. Falconer conjectured that the $\Delta(S)$ has positive Lebesque measure if the Hausdorff dimension of $S$…

If the system S of contracting similitudes on $ R^2$ satisfies open convex set condition, then the set F of extreme points of the convex hull $\tilde{K}$ of it's invariant self-similar set K has Hausdorff dimension 0 . If, additionally, all…

We prove that if ${\mathcal E} \subset {\Bbb R}^{2d}$, $d \ge 2$, is an Ahlfors-David regular product set of sufficiently large Hausdorff dimension, denoted by $dim_{{\mathcal H}}({\mathcal E})$, and $\phi$ is a sufficiently regular…

We prove that if the Hausdorff dimension of $E\subset\mathbb{R}^d$, $d\geq 2$ is greater than $\frac{d}{2}+\frac{1}{3}$, the set of gaps of $2$-chains inside $E$, $$\Delta_2(E)=\{(|x-y|, |y-z|): x, y, z\in E \}\subset\mathbb{R}^2$$ has…

In this paper, exact Hausdorff dimension formulas for a class of self-affine attractors generated by affine Iterated Function Systems are derived. We consider systems containing an affine map whose $n$-th iterate is a similarity…

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 develop a versatile framework which allows us to rigorously estimate the Hausdorff dimension of maximal conformal graph directed Markov systems in $\mathbb{R}^n$ for $n \geq 2$. Our method is based on piecewise linear approximations of…

The purpose of this paper is to study the fractal phenomena in large data sets and the associated questions of dimension reduction. We examine situations where the classical Principal Component Analysis is not effective in identifying the…

It is known that if a compact set $E$ in $\mathbb{R}^d$ has Hausdorff dimension greater than $(d+1)/2$, then its $n$-chain distance set $$\Delta^n(E) = \left\{\left(\left|x^1-x^2\right|,\cdots, \left|x^{n}- x^{n+1}\right|\right)\in…

Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in…

In this paper, we study Hausdorff and Fourier dimension from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity. Working in the hyperspace $\mathbf{K}(X)$ of compact subsets of $X$, with $X=[0,1]^d$ or…

We present a new method to calculate the Hausdorff dimension of a certain class of fractals: boundaries of self-affine tiles. Among the interesting aspects are that even if the affine contraction underlying the iterated function system is…

This paper investigates a class of deterministic fractals whose construction is governed by arithmetic sequences. We introduce the essential fractal prime set P_{ess} , a variant of the Cantor set constructed using the sequence of prime…

The Hausdorff distance is a fundamental measure for comparing sets of vectors, widely used in database theory and geometric algorithms. However, its exact computation is computationally expensive, often making it impractical for large-scale…

A clustering algorithm based on the Hausdorff distance is introduced and compared to the single and complete linkage. The three clustering procedures are applied to a toy example and to the time series of financial data. The dendrograms are…

We consider the problem of computing the (two-sided) Hausdorff distance between the unit $\ell_{p_{1}}$ and $\ell_{p_{2}}$ norm balls in finite dimensional Euclidean space for $1 \leq p_1 < p_2 \leq \infty$, and derive a closed-form formula…

Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…

We present a (combinatorial) algorithm with running time close to $O(n^d)$ for computing the minimum directed $L_\infty$ Hausdorff distance between two sets of $n$ points under translations in any constant dimension $d$. This substantially…

Let X= {X_t, t \ge 0} be a continuous time random walk in an environment of i.i.d. random conductances {\mu_e \in [1, \infty), e \in E_d}, where E_d is the set of nonoriented nearest neighbor bonds on the Euclidean lattice Z^d and d\ge 3.…