Related papers: Effective dimension in some general metric spaces
The two most important notions of fractal dimension are {\it Hausdorff dimension}, developed by Hausdorff (1919), and {\it packing dimension}, developed by Tricot (1982). Lutz (2000) has recently proven a simple characterization of…
We establish that constructive continued fraction dimension originally defined using $s$-gales is robust, but surprisingly, that the effective continued fraction dimension and effective (base-$b$) Hausdorff dimension of the same real can be…
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…
This paper considers two notions of effective dimension for quadrature in weighted pre-Sobolev spaces with dominating mixed partial derivatives. We begin by finding a ball in those spaces just barely large enough to contain a function with…
Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When…
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…
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive…
Effective dimension has proven very useful in geometric measure theory through the point-to-set principle \cite{LuLu18}\ that characterizes Hausdorff dimension by relativized effective dimension. Finite-state dimension is the least…
In this paper, we consider regression models with a Hilbert-space-valued predictor and a scalar response, where the response depends on the predictor only through a finite number of projections. The linear subspace spanned by these…
Fractal-like structures of varying complexity are common in nature, and measure-based dimensions (Minkowski, Hausdorff) supply their basic geometric characterization. However, at the level of fundamental dynamics, which is quantum,…
Within the scope of multidimensional Kaluza--Klein gravity with nonlinear curvature terms and two spherical extra spaces of dimensions $m$ and $n$, we study the properties of an effective action for the scale factors of the extra…
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower…
We study the effective spacetimes in lower dimensions that can be extracted from a multidimensional generalization of the Schwarzschild-Tangherlini spacetimes derived by Fadeev, Ivashchuk and Melnikov ({\it Phys. Lett,} {\bf A 161} (1991)…
We present an overview of some results about characterization of compactness in which the concept of approximation scheme has had a role. In particular, we present several results that were proved by the second author, jointly with Luther,…
In this paper (as in [Ken15]), we consider an effective version of the characterization of separable metric spaces as zero-dimensional iff every nonempty closed subset is a retract of the space (actually, it is a relative result for closed…
We introduce the notion of scale to generalize and compare different invariants of metric spaces and their measures. Several versions of scales are introduced such as Hausdorff, packing, box, local and quantization. They moreover are…
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set…
We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…
We prove that the algorithm of [13] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on…