Related papers: Some properties of antistochastic strings
Supersymmetric states in M-theory are mapped after compactification to perturbatively non-supersymmetric states in type IIA string theory, with the supersymmetric parts being encoded in the non-perturbative section of the string theory. An…
This paper presents segmentation-free strategies for the recognition of handwritten numeral strings of unknown length. A synthetic dataset of touching numeral strings of sizes 2-, 3- and 4-digits was created to train end-to-end solutions…
Recently perfectly secure steganographic systems have been described for a wide class of sources of covertexts. The speed of transmission of secret information for these stegosystems is proportional to the length of the covertext. In this…
Semantically non-compositional phrases constitute an intriguing research topic in Natural Language Processing. Semantic non-compositionality --the situation when the meaning of a phrase cannot be derived from the meaning of its components,…
Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…
The set of all $ q $-ary strings that do not contain repeated substrings of length $ \leqslant\! 3 $ (i.e., that do not contain substrings of the form $ a a $, $ a b a b $, and $ a b c a b c $) constitutes a code correcting an arbitrary…
Recovering a low-complexity signal from its noisy observations by regularization methods is a cornerstone of inverse problems and compressed sensing. Stable recovery ensures that the original signal can be approximated linearly by optimal…
In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for…
In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs'…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
We consider the task of constructing a data structure for associating a static set of keys with values, while allowing arbitrary output values for queries involving keys outside the set. Compared to hash tables, these so-called static…
We construct the Hamiltonian operator of the string field theory for $c=0$ string theory. It describes how strings evolve in the coordinate frame, which is defined by using the geodesic distance on the worldsheet. The Hamiltonian consists…
We develop a powerful analytical formalism for calculating the energy density of the stochastic gravitational wave background, including a full description of its anisotropies. This is completely general, and can be applied to any…
We propose novel algorithms for sequence prediction based on ideas from stringology. These algorithms are time and space efficient and satisfy mistake bounds related to particular stringological complexity measures of the sequence. In this…
It is known that classical string dynamics in pure AdS_5\times S^5 is integrable and plays an important role in solvability. This is a deep and central issue in holography. Here we investigate similar classical integrability for a more…
The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…
In this paper we define contractive and nonexpansive properties for adapted stochastic processes $X_1, X_2, \ldots $ which can be used to deduce limiting properties. In general, nonexpansive processes possess finite limits while contractive…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
In this paper we extend the analysis of the stability of an homogeneous black string in the presence of a negative cosmological constant with minimally coupled scalar fields. We recall the linear stability of this solutions under generic…
The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…