Related papers: The Dimensions of Individual Strings and Sequences

We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…

We investigate the field theory of strings having as a target space an arbitrary discrete one-dimensional manifold. The existence of the continuum limit is guaranteed if the target space is a Dynkin diagram of a simply laced Lie algebra or…

Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…

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…

Hausdorff dimension results are a classical topic in the study of path properties of random fields. This article presents an alternative approach to Hausdorff dimension results for the sample functions of a large class of self-affine random…

We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…

In an earlier paper (arxiv:1108.4292) we introduced a new concept of dimension for metric spaces, the so called topological Hausdorff dimension. For a compact metric space $K$ let $\dim_{H}K$ and $\dim_{tH} K$ denote its Hausdorff and…

We show how to make a topological string theory starting from an $N=4$ superconformal theory. The critical dimension for this theory is $\hat c= 2$ ($c=6$). It is shown that superstrings (in both the RNS and GS formulations) and critical…

In six spacetime dimensions, the heterotic string is dual to a Type $IIA$ string. On further toroidal compactification to four spacetime dimensions, the heterotic string acquires an $SL(2,\BbbZ)_S$ strong/weak coupling duality and an…

We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…

The rank of a ring $R$ is the supremum of minimal cardinalities of generating sets of $I$ as $I$ ranges over ideals of $R$. Matson showed that every positive integer occurs as the rank of some ring $R$. Motivated by the result of Cohen and…

We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…

A not necessarily noetherian local ring O is called regular if every finitely generated ideal I of O possesses finite projective dimension. In the article localizations O of a finitely presented, flat algebra A over a Pruefer domain R at a…

We show that, for any $0<\gamma<1/2$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set with Hausdorff dimension about $\sqrt{\gamma}$, any small $0<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such…

In 2004, Dai, Lathrop, Lutz, and Mayordomo defined and investigated the finite-state dimension (a finite-state version of algorithmic dimension) of a sequence $S \in \Sigma^\infty$ and, in 2018, Case and Lutz defined and investigated the…

The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…

It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two…

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Any binary string can be associated with a unary predicate $P$ on $\mathbb{N}$. In this paper we investigate subsets named by a predicate $P$ such that the relation $P(x+y)$ has finite VC dimension. This provides a measure of complexity for…

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…