Related papers: A $2$-branching construction for the $\chi \leq 2r…
In the Shortest Superstring problem, we are given a set of strings and we are asking for a common superstring, which has the minimum number of characters. The Shortest Superstring problem is NP-hard and several constant-factor approximation…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
A finite deterministic (semi)automaton $\mathcal{A} =(Q,\Sigma,\delta)$ is $k$-compressible if there is some word $w\in \Sigma^+$ such that the image of its state set $Q$ under the natural action of $w$ is reduced by at least $k$ states.…
We study some features of the confining string connecting a quark-anti-quark pair in Yang-Mills theory. Monte Carlo investigations of the flux tube between two static quarks in the fundamental representation show that its thickness…
We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string $w$, a bidirectional macro scheme of size $O(r_B)$ can be induced from the BBWT of $w$, where $r_B$ is the number of maximal character…
We prove that $\chi(G) \leq \max {\omega(G), \Delta_2(G), (5/6)(\Delta(G) + 1)}$ for every graph $G$ with $\Delta(G) \geq 3$. Here $\Delta_2$ is the parameter introduced by Stacho that gives the largest degree that a vertex $v$ can have…
We study the compactification of the $(2,0)$ and type-II little-string theories on $S^1$, $T^2$ and $T^3$ with an R-symmetry twist that preserves half the supersymmetry. We argue that it produces the same moduli spaces of vacua as…
We study the quantum broadening (width) of k-strings. We generalise an old result by Luscher, Munster and Weisz to the case of a k-string, by using the gauge/gravity correspondence. When the fundamental QCD-string is replaced by a bound…
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…
In this paper, we relate the seemingly unrelated concepts of treewidth and boxicity. Our main result is that, for any graph G, boxicity(G) <= treewidth(G) + 2. We also show that this upper bound is (almost) tight. Our result leads to…
We determine explicitly all structure constants of the whole chiral BRST cohomology ring in $D=2$ string theory including both the discrete states and tachyon states. This is made possible by establishing several identities for Schur…
The simplest toroidally compactified string theories exhibit a duality between large and small radii: compactification on a circle, for example, is invariant under R goes to 1/R. Compactification on more general Lorentzian lattices (i.e.…
We investigate the structure and reconstruction complexity of Manacher arrays. First, we establish a combinatorial lower bound, proving that the number of rooted tandem repeat trees with $n+1$ genes exceeds the number of distinct Manacher…
A string field theory of (p,q) minimal superstrings is constructed with the free-fermion realization of 2-component KP (2cKP) hierarchy, starting from 2-cut ansatz of two-matrix models. Differential operators of 2cKP hierarchy are…
The sensitivity of a string compression algorithm $C$ asks how much the output size $C(T)$ for an input string $T$ can increase when a single character edit operation is performed on $T$. This notion enables one to measure the robustness of…
A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well known result states that graphs with the same degree sequence may be changed into each other via…
We investigate how SL(2,Z) duality is realized in nonrelativistic type IIB superstring theory, which is a self-contained corner of relativistic string theory. Within this corner, we realize manifestly SL(2,Z)-invariant (p,q)-string actions.…
The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…
We re-examine a closed-string model defined by altering the boundary conditions for one handedness of two-dimensional propagators in otherwise-standard string theory. We evaluate the amplitudes using Kawai-Lewellen-Tye factorization into…
We publish a table of primitive finite-type invariants of order less than or equal to six, for knots of ten or fewer crossings. We note certain mod-2 congruences, one of which leads to a chirality criterion in the Alexander polynomial. We…