Related papers: The Dimensions of Individual Strings and Sequences
A new homological dimension is introduced to measure the quality of resolutions of `singular' finite dimensional algebras (of infinite global dimension) by `regular' ones (of finite global dimension). Upper bounds are established in terms…
We show that, almost surely, the Hausdorff dimension $s_0$ of a random covering set is preserved under all orthogonal projections to linear subspaces with dimension $k>s_0$. The result holds for random covering sets with a generating…
It is well known that normality can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of "lossless finite-state compressors" do not follow…
We define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections…
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 study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the…
Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many…
We consider a class of random graphs, called random brushes, which are constructed by adding linear graphs of random lengths to the vertices of Z^d viewed as a graph. We prove that for d=2 all random brushes have spectral dimension d_s=2.…
Verma modules of superconfomal algebras can have singular vector spaces with dimensions greater than 1. Following a method developed for the Virasoro algebra by Kent, we introduce the concept of adapted orderings on superconformal algebras.…
We explain how to use Kolmogorov Superposition Theorem (KST) to break the curse of dimensionality when approximating a dense class of multivariate continuous functions. We first show that there is a class of functions called…
A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular…
Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures are employed to estimate the repetitiveness of…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
We study lower and upper bounds of the Hausdorff dimension for sets which are wiggly at scales of positive density. The main technical ingredient is a construction, for every continuum K, of a Borel probabilistic measure \mu with the…
Let $S_n$ be the total gain in $n$ repeated St.\ Petersburg games. It is known that $n^{-1}(S_n-n\log_2n)$ converges in distribution to a random element $Y(t)$ along subsequences of the form $k(n)=2^{p(n)}t(n)$ with…
We prove a sharp upper bound on the Hausdorff dimension of weighted singular vectors in $\mathbb{R}^m$ using dynamics on homogeneous spaces, specifically the method of integral inequalities. Together with the lower bound proved recently by…
Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information…
We present a general algorithm which permits to construct solutions in string cosmology for heterotic and type-IIB superstrings in four dimensions. Using a chain of transformations applied in sequence: conformal, T-duality and SL(2,R)…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
Let $\{X_n= e^{2\pi i \theta_n}\}$ be a sequence of Steinhaus random variables, where $\theta_n$ are independent and uniformly distributed on $[0,1]$. We compute the almost sure Hausdorff dimension of the images and graphs of the random…