Related papers: Two strings at Hamming distance 1 cannot be both q…
For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…
I describe how superstring theory may violate spin-statistics in an experimentally observable manner. Reviewing the basics of superstring interactions and how to utilize these to produce a statistical phase, I then apply these ideas to two…
Alice and Bob want to know if two strings of length n are almost equal. That is, do they differ on \textit{at most} a bits? Let 0\leq a\leq n-1. We show that any deterministic protocol, as well as any error-free quantum protocol (C*…
The heterotic string occurs as a soliton of the type I superstring in ten dimensions, supporting the conjecture that these two theories are equivalent. The conjecture that the type IIB string is self-dual, with the strong coupling dynamics…
A classical measure of string comparison is given by the longest common subsequence (LCS) problem on a pair of strings. We consider its generalisation, called the semi-local LCS problem, which arises naturally in many string-related…
A pattern $\alpha$ is a string of variables and terminal letters. We say that $\alpha$ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $\alpha$ by terminal words. The matching…
We give a brief overview of the nature of spacetime emerging from string theory. This is radically different from the familiar spacetime of Einstein's relativity. At a perturbative level, the spacetime metric appears as ``coupling…
We propose an alternative interpretation for the meaning of noncommutativity of the string-inspired field theories and quantum mechanics. Arguments are presented to show that the noncommutativity generated in the stringy context should be…
The conical singularity in flat spacetime is mostly known as a model of the cosmic string or the wedge disclination in solids. Its another, equally important, function is to be a representative of quasiregular singularities. From all these…
We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one of its interior letters creates a square (respectively, overlap,…
Most periodic systems are governed by short-range interactions as long-range interactions in these systems diminish uniformly. In this letter, however, we demonstrate that this is not true for a more general class of systems, which possess…
We argue that apart from the standard closed and open strings one may consider a third possibility that we call monodromic strings. The monodromic string propagating on a target looks like an ordinary open string (a mapping from a segment…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
Quasiperiodic behaviour is known to occur in systems with enforced quasiperiodicity or randomness, in either the lattice structure or the potential, as well as in periodically driven systems. Here, we present instead a setting where…
We address the separability problem for straight-line string constraints. The separability problem for languages of a class C by a class S asks: given two languages A and B in C, does there exist a language I in S separating A and B (i.e.,…
There have been many remarkable developments in our understanding of superstring theory in the past few years, a period that has been described as ``the second superstring revolution.'' Several of them are discussed here. The presentation…
I describe our understanding of physics near the planck length, in particular the great progress of the last four years in string theory. Superstring theory, and a recent extension called M theory, are leading candidates for a quantum…
We study the satisfiability of string constraints where context-free membership constraints may be imposed on variables. Additionally a variable may be constrained to be a subword of a word obtained by shuffling variables and their…
A weighted string, also known as a position weight matrix, is a sequence of probability distributions over some alphabet. We revisit the Weighted Shortest Common Supersequence (WSCS) problem, introduced by Amir et al. [SPIRE 2011], that is,…