Related papers: On the d-complexity of strings
We consider string theory in a time dependent orbifold with a null singularity. The singularity separates a contracting universe from an expanding universe, thus constituting a big crunch followed by a big bang. We quantize the theory both…
We study a theory of particles interacting with strings. Considering such a theory for Type IIA superstring will give some clue about M-theory. As a first step toward such a theory, we construct the particle-particle-string interaction…
Tools that effectively analyze and compare sequences are of great importance in various areas of applied computational research, especially in the framework of molecular biology. In the present paper, we introduce simple geometric criteria…
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and…
This document is an elementary introduction to string diagrams. It takes a computer science perspective: rather than using category theory as a starting point, we build on intuitions from formal language theory, treating string diagrams as…
Special kind of closed strings is considered. It is shown that these closed strings behave as two (an even number of) open strings at the classical level and one open string at the quantum level. They contain massless vector field in their…
The aim of these notes is to give recent developments in string theory. In particular, we discuss the string spectrums, compactifications, brane physics and dualities.
The phenomenological aspects of string theory are briefly reviewed. Emphasis is given to the status of 4D string model building, effective Lagrangians, model independent results, supersymmetry breaking and duality symmetries.
Over the last few years, string theory has changed profoundly. Most importantly, novel duality relations have emerged which involve gauge theories of brane excitations on one side and various closed string backgrounds on the other. In this…
We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.
We introduce the complex Liouville string, a solvable string theory defined by coupling two Liouville theories with complex conjugate central charges $c \in 13+i \mathbb{R}$ on the worldsheet. We compute its amplitudes from first principles…
I review some of the recent progress in two-dimensional string theory, which is formulated as a sum over surfaces embedded in one dimension.
We demonstrate that the spectrum of any consistent string theory in $D$ dimensions must satisfy a number of supertrace constraints: $ Str~M^{2n}=0 $ for $0 \leq n < D/2-1$, integer $n$. These results hold for a large class of string…
This is an invited contribution to the Special Issue of "Foundations of Physics" titled "Forty Years Of String Theory: Reflecting On the Foundations". I have been asked to assess string theory as an outsider, and to compare it with the…
The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and…
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded…
We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…
One cannot yet point to any firm string prediction. While many approximate string ground states are known with interesting properties, we do not have any argument that one or another describes what we observe around us, and for reasons…
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the…
The normalized substring complexity $\delta$ of a string is defined as $\max_k \{c[k]/k\}$, where $c[k]$ is the number of \textit{distinct} substrings of length $k$. This simply defined measure has recently attracted attention due to its…