相关论文: Some properties of antistochastic strings

In this talk we review briefly the basic features of non-critical (dissipative) String Cosmologies, and we confront some of these models with supernova data. We pay particular attention to the off-shell and dilaton contributions to the…

Superstring theory on black-strings backgrounds, corresponding to deformed, rotating BTZ black holes, formed by $p$ fundamental strings or negative strings, is inspected. For non-rotating black strings, in the positive case, it was shown in…

It is shown that the length of the algorithmic minimal sufficient statistic of a binary string x, either in a representation of a finite set, computable semimeasure, or a computable function, has a length larger than the computational depth…

We present a new data structure called the \emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string $T$ of characters, e.g., representing the memory of a computer, in compressed form while achieving asymptotically…

A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their…

The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the…

In this paper we discuss symmetry breaking in string theory. Spacetime symmetries are implemented as inner automorphisms of the underlying superconformal algebra. Conserved currents generate unbroken spacetime symmetries. As we deform the…

Global symmetries of the string effective action are employed to generate tilted, homogeneous Bianchi type VI_h string cosmologies from a previously known stiff perfect fluid solution to Einstein gravity. The dilaton field is not constant…

Suppose we are asked to preprocess a string \(s [1..n]\) such that later, given a substring's endpoints, we can quickly count how many distinct characters it contains. In this paper we give a data structure for this problem that takes \(n…

We compute directly in covariant formalism various four point massive scalar amplitudes in bosonic string with scalars up to level 11. The most ``difficult'' amplitude we consider is four identical scalars at level 4, i.e. the first non…

We present a new formulation of the tensionless string ($T= 0$) where the space-time conformal symmetry is manifest. Using a Hamiltonian BRST scheme we quantize this {\em Conformal String} and find that it has critical dimension $D=2$. This…

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…

It is shown that topologically stable cosmic strings can, in fact, appear to end or to break, even in theories without monopoles. This can occur whenever the spatial topology of the universe is nontrivial. For the case of Abelian-Higgs…

Free scalar field theory in the sector with a large number of particles can be interpreted as bosonic string theory on anti-de Sitter space of vanishing radius. Different ways of writing the field theory Hamiltonian translate to different…

We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been…

This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e.,…

We argue that string theory emerges inevitably from a few simple assumptions about physical scattering. Consistency alone requires that all tree-level four-point scattering amplitudes exhibit vanishing residues at prescribed values of the…

We show that the BRS operator of the topological string B model is not holomorphic in the complex structure of the target space. This implies that the so-called holomorphic anomaly of topological strings should not be interpreted as a BRS…

Probabilistic programming languages represent complex data with intermingled models in a few lines of code. Efficient inference algorithms in probabilistic programming languages make possible to build unified frameworks to compute…

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…