Related papers: The Dimensions of Individual Strings and Sequences
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…
Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…
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…
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,…
Let $A=kQ/I$ be a finite dimensional basic algebra over an algebraically closed field $k$ which is a gentle algebra with the marked ribbon surface $(\mathcal{S}_A,\mathcal{M}_A,\Gamma_A)$. It is known that $\mathcal{S}_A$ can be divided…
Let $\{s_n\}$ and $\{t_n\}$ be two sequences of positive real numbers. Under some mild conditions on $\{s_n\}$ and $\{t_n\}$, we give the precise formula of the Hausdorff dimension of the set \[ \mathbb{E}(\{s_n\},\{t_n\}):=\Big\{x\in(0,1):…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
All strings with low mutual information with the halting sequence will have flat Kolmogorov Structure Functions, in the context of Algorithmic Statistics. Assuming the Independence Postulate, strings with non-negligible information with the…
If $S$ and $T$ are infinite sequences over a finite alphabet, then the lower and upper mutual dimensions $mdim(S:T)$ and $Mdim(S:T)$ are the upper and lower densities of the algorithmic information that is shared by $S$ and $T$. In this…
The almost sure Hausdorff dimension of the limsup set of randomly distributed rectangles in a product of Ahlfors regular metric spaces is computed in terms of the singular value function of the rectangles.
Spurious correlations are common in time-series analysis because simple, low-complexity patterns can produce high Pearson correlations even between unrelated series. We argue that Kolmogorov complexity, interpreted as resistance to…
We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to Martin-Lof random reals, identify a point with lower…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…
A global superalgebra with 32 supercharges and all possible central extensions is studied in order to extract some general properties of duality and hidden dimensions in a theory that treats $p$-branes democratically. The maximal number of…
In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or…
The classical Aronszajn-Donoghue theorem states that for a rank one perturbation of a self-adjoint operator (by a cyclic vector) the singular parts of the spectral measures of the original and perturbed operators are mutually singular. As…
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…