相关论文: Some properties of antistochastic strings

We present a novel derivation of the full holographic conformal anomaly in two five-dimensional scalar-tensor theories-one Lovelock-Horndeski type and one Einstein-dilaton-Gauss-Bonnet-obtained via a unified mechanism for Kaluza-Klein…

In this short note we formulate a stabilizer formalism in the language of noncommutative graphs. The classes of noncommutative graphs we consider are obtained via unitary representations of compact groups, and suitably chosen operators on…

Null strings, strings with Carrollian worldsheets, are traditionally described by the Isberg-Lindstr\"om-Sundborg-Theodoridis (ILST) action, which is obtained via a tensionless limit of standard tensile strings. In a recent work, we…

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

Peter Gacs showed (Gacs 1974) that for every n there exists a bit string x of length n whose plain complexity C(x) has almost maximal conditional complexity relative to x, i.e., C(C(x)|x) > log n - log^(2) n - O(1). (Here log^(2) i = log…

It is explained that, for black holes much heavier than the Planck mass, black hole microstates can be well understood without string theory. It is essential to understand the antipodal identification at the horizon. We show why the…

We identify string corrections to the EM memory effect. Though largely negligible in the low-energy limit, the effect become relevant in high-energy collisions and in extreme events. We illustrate our findings in a simple unoriented bosonic…

We simulate the formation of cosmic strings at the zeros of a complex Gaussian field with a power spectrum $P(k) \propto k^n$, specifically addressing the issue of the fraction of length in infinite strings. We make two improvements over…

In this paper we consider the role that worldsheet instantons in the heterotic string could play in spin-statistics violations. Such violations are nonperturbative in the string tension and so would not appear in the spacetime effective…

Synchronization strings are recently introduced by Haeupler and Shahrasbi [HS17a] in the study of codes for correcting insertion and deletion errors (insdel codes). A synchronization string is an encoding of the indices of the symbols in a…

Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…

The SO(32) heterotic string can be obtained from the type IIB string by gauging a discrete symmetry that acts as $(-1)^{F_L}$ on the perturbative string states and reverses the parity of the D-string. Consistency requires the presence of 32…

The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, whose applications include symbolic execution and automated detection of cross-site scripting (XSS)…

Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in…

An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string…

Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information…

A long-standing puzzle about the heterotic string has been what happens when an instanton shrinks to zero size. It is argued here that the answer at the quantum level is that an extra $SU(2)$ gauge symmetry appears that is supported in the…

Suppose we want to seek the longest common subsequences (LCSs) of two strings as informative patterns that explain the relationship between the strings. The dynamic programming algorithm gives us a table from which all LCSs can be extracted…

A degenerate symbol x* over an alphabet A is a non-empty subset of A, and a sequence of such symbols is a degenerate string. A degenerate string is said to be conservative if its number of non-solid symbols is upper-bounded by a fixed…

A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…