Related papers: Geometric Bounds for Favard Length
In this paper we prove some lower bounds on the Hausdorff dimension of sets of Furstenberg type. Moreover, we extend these results to sets of generalized Furstenberg type, associated to doubling dimension functions. With some additional…
Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…
The behavior of the Hausdorff dimension of a set when projected onto a subspace is a fundamental question in fractal geometry. In this paper, we settle a question of Fassler and Orponen concerning the dimension of a set when projected onto…
Generalized polyhedral convex sets, generalized polyhedral convex functions on locally convex Hausdorff topological vector spaces, and the related constructions such as sum of sets, sum of functions, directional derivative, infimal…
We introduce fractional flat space, described by a continuous geometry with constant non-integer Hausdorff and spectral dimensions. This is the analogue of Euclidean space, but with anomalous scaling and diffusion properties. The basic tool…
The fractal or Hausdorff dimension is a measure of roughness (or smoothness) for time series and spatial data. The graph of a smooth, differentiable surface indexed in $\mathbb{R}^d$ has topological and fractal dimension $d$. If the surface…
Most of the known methods for estimating the fractal dimension of fractal sets are based on the evaluation of a single geometric characteristic, e.g. the volume of its parallel sets. We propose a method involving the evaluation of several…
Bounding and predicting the generalization gap of overparameterized neural networks remains a central open problem in theoretical machine learning. There is a recent and growing body of literature that proposes the framework of fractals to…
We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural…
The classical Hausdorff dimension of finite or countable sets is zero. We define an analog for finite sets, called finite Hausdorff dimension which is non-trivial. It turns out that a finite bound for the finite Hausdorff dimension…
Let F be a family of Borel measurable functions on a complete separable metric space. The gap (or fat-shattering) dimension of F is a combinatorial quantity that measures the extent to which functions f in F can separate finite sets of…
Hausdorff dimensions of level sets of generic continuous functions defined on fractals were considered in two papers by R. Balka, Z. Buczolich and M. Elekes. In those papers the topological Hausdorff dimension of fractals was defined. In…
Fibonacci word fractals are a class of fractals that have been studied recently, though the word they are generated from is more widely studied in combinatorics. The Fibonacci word can be used to draw a curve which possesses…
Fractal Lipschitz-Killing curvature measures C^f_k(F,.), k = 0, ..., d, are determined for a large class of self-similar sets F in R^d. They arise as weak limits of the appropriately rescaled classical Lipschitz-Killing curvature measures…
We establish the dimension version of Falconer's distance set conjecture for sets of equal Hausdorff and packing dimension (in particular, for Ahlfors-regular sets) in all ambient dimensions. In dimensions $d=2$ or $3$, we obtain the first…
Irregular boundary lines can be characterized by fractal dimension, which provides important information for spatial analysis of complex geographical phenomena such as cities. However, it is difficult to calculate fractal dimension of…
By applying a 2014 result on the distribution of full cylinders, we give a proof of the useful folklore: for any $\beta>1$, the Hausdorff dimension of an arbitrary set in the shift space $S_\beta$ is equal to the Hausdorff dimension of its…
We introduce a technique that uses projection properties of fractal percolation to establish dimension conservation results for sections of deterministic self-similar sets. For example, let $K$ be a self-similar subset of $\mathbb{R}^2$…
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and…
We prove that if $E$ is a planar self-similar set with similarity dimension $d$ whose defining maps generate a dense set of rotations, then the $d$-dimensional Hausdorff measure of the orthogonal projection of $E$ onto any line is zero. We…