Related papers: Two strings at Hamming distance 1 cannot be both q…
In the past three years our views on how the standard model of particle physics could be embedded into string theory have dramatically changed. The heterotic string is no longer the only possibility for such an embedding and other…
An order-preserving square in a string is a fragment of the form $uv$ where $u\neq v$ and $u$ is order-isomorphic to $v$. We show that a string $w$ of length $n$ over an alphabet of size $\sigma$ contains $\mathcal{O}(\sigma n)$…
We consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…
The description of almost periodic or quasiperiodic structures has a long tradition in mathematical physics, in particular since the discovery of quasicrystals in the early 80's. Frequently, the modelling of such structures leads to…
A new set of boundary conditions for string propagators is proposed in this paper. The boundary conditions are parametrized by a complex number $\lambda$. Under these new boundary conditions, the left-moving and right-moving modes are…
It has been pointed out that cosmic string solutions can exist in gauge field theories with broken symmetry even when $\pi _1(G/H)$ is trivial. The stability of such semilocal defects is not guaranteed by topology and depends on dynamical…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
String theory has been the dominating research field in theoretical physics during the last decades. Despite the considerable time elapse, no new testable predictions have been derived by string theorists and it is understandable that…
A finite word $f$ is Hamming-isometric if for any two word $u$ and $v$ of same length avoiding $f$, $u$ can be transformed into $v$ by changing one by one all the letters on which $u$ differs from $v$, in such a way that all of the new…
We analyze finite and infinite words coming from the symbolic version of Chacon's transformation, focusing on distances between such words. Our main result is that if W = 0010 0010 1 0010 ... is the infinite word usually associated with…
We demonstrate that string consistency in four spacetime dimensions leads to a spectrum of string states which satisfies the supertrace constraints Str(M^0)=0 and Str(M^2)=\Lambda at tree level, where \Lambda is the one-loop string…
A square is a concatenation of two identical words, and a word $w$ is said to have a square $yy$ if $w$ can be written as $xyyz$ for some words $x$ and $z$. It is known that the ratio of the number of distinct squares in a word to its…
Whilst standard field theoretic Cosmic Strings cannot end, Cosmic Superstrings can form three string junctions, at which each string ends. This opens up a new class of possible boundary conditions for such strings and we show that, at least…
We present a brief history of quasicrystals and a short introduction to classical lattice-gas models of interacting particles. We discuss stability of non-periodic tilings and one-dimensional sequences of symbols seen as ground states of…
We investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood.…
A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence…
For $d\ge 1$, a word $w\in \{ 0,1\}^{\Z^d}$ is called balanced if there exists $M > 0$ such that for any two rectangles $R, R^{'}\subset\Z^d$ that are translates of each other, the number of occurrences of the symbol $1$ in $R$ and $R^{'}$…
We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…
We study the interaction of several types of static straight cosmic strings, including local strings, global strings, and bosonic superconducting strings with and without magnetic currents. First, we evaluate the interaction energy of two…
In this paper we consider measures of similarity between two sets of strings built up using the Hamming distance and tools of persistence homology as a basis. First we describe the construction of the \v Cech filtration adjoined to the set…