相关论文: Some properties of antistochastic strings
Concurrent coding is an encoding scheme with "holographic" type properties that are shown here to be robust against a significant amount of noise and signal loss. This single encoding scheme is able to correct for random errors and burst…
As we discuss, a stationary stochastic process is nonergodic when a random persistent topic can be detected in the infinite random text sampled from the process, whereas we call the process strongly nonergodic when an infinite sequence of…
We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…
The holomorphy of the superpotential along with symmetries gives very strong constraints on any stringy non-perturbative effects. This observation suggests an approach to string phenomenology. (Presented at ``Strings 95'', March 1995.
This paper is a significantly expanded version of gr-qc/0306066. It discusses the geometric properties of the so called holographic solution, an exact, spherically symmetric solution to the Einstein field equations with zero cosmological…
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov complexity is the key to…
The main subject of the paper is everywhere complex sequences. An everywhere complex sequence is a sequence that does not contain substrings of Kolmogorov complexity less than $\alpha n-O(1)$ where $n$ is the length of substring and…
Is it possible to find a shortest description for a binary string? The well-known answer is "no, Kolmogorov complexity is not computable." Faced with this barrier, one might instead seek a short list of candidates which includes a laconic…
We construct a string field Hamiltonian for a noncritical string theory with the continuum limit of the Ising model or its generalization as the matter theory on the worldsheet. It consists of only three string vertices as in the case for…
We define non-relativistic string in the background with non-trivial metric. Then we analyze its properties when we focus on integrability of this string in AdS(5)xS(5) background.
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at…
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
An infinite binary sequence has randomness rate at least $\sigma$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on one hand,…
The statistical mechanics of black holes arbitrarily far from extremality is modeled by a gas of weakly interacting strings. As an effective low energy description of black holes the model provides a number of highly non-trivial consistency…
Little String Theory (LST) is a still somewhat mysterious theory that describes the dynamics near a certain class of time-like singularities in string theory. In this paper we discuss the topological version of LST, which describes…
The holographic solution is a new exact solution to the Einstein field equations. It describes a compact self-gravitating object with properties similar to a black hole. Its entropy and temperature at infinity are proportional to the…
Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…
We provide the first holographic evidence for the existence of a non-supersymmetric conformal manifold arising from exactly marginal but supersymmetry-breaking deformations of a superconformal three-dimensional field theory. In particular,…
We present detailed discussions on the stochastic Hamiltonians for non-critical string field theories on the basis of matrix models. Beginning from the simplest $c=0$ case, we derive the explicit forms of the Hamiltonians for the higher…
For every total recursive time bound $t$, a constant fraction of all compressible (low Kolmogorov complexity) strings is $t$-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of…