Related papers: On Extensions of Maximal Repeats in Compressed Str…
Longest Run Subsequence is a problem introduced recently in the context of the scaffolding phase of genome assembly (Schrinner et al., WABI 2020). The problem asks for a maximum length subsequence of a given string that contains at most one…
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability.…
We show that the number of all maximal $\alpha$-gapped repeats and palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and $7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.
The Burrows-Wheeler Transform (BWT) is among the most influential discoveries in text compression and DNA storage. It is a reversible preprocessing step that rearranges an $n$-letter string into runs of identical characters (by exploiting…
A word is called $\beta$-free if it has no factors of exponent greater than or equal to $\beta$. The repetition threshold $\mathrm{RT}(k)$ is the infimum of the set of all $\beta$ such that there are arbitrarily long $k$-ary $\beta$-free…
Motivated by arXiv:1203.5553, we continue to match super string amplitudes with their own effective field theory. We carry out within full details the computations of the complete form of the amplitude of one closed string Ramond-Ramond…
One expects type II string theory to be the unique ultraviolet completion of maximal supergravity. Motivated by the recent computation of the unitary bound on the leading Wilson coefficient within the S-matrix bootstrap, we analyse the…
Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…
The focus of this thesis is the study and construction of covering arrays, relying on maximal period sequences and other tools from finite fields. A covering array of strength $t$, denoted $\mathrm{CA}(N; t, k,v)$, is an $N\times k$ array…
Re-Pair is an efficient grammar compressor that operates by recursively replacing high-frequency character pairs with new grammar symbols. The most space-efficient linear-time algorithm computing Re-Pair uses $(1+\epsilon)n+\sqrt n$ words…
We review old and recent results on a special limit of string theory on AdS$_3\times M_7$ with pure NS-NS fluxes: the limit in which the string length $\ell_s=\sqrt{\alpha'}$ equals the AdS$_3$ radius $R $. At this point of the moduli…
Reduced parameters [BKW, JCTB '26; BKRT, SODA '22] are defined via contraction sequences. Based on this framework, we introduce the reduced component max-leaf, denoted by $\operatorname{cml}^\downarrow$, where component max-leaf is the…
Recently, it was shown that any theory of strings containing the string-replace function (even the most restricted version where pattern/replacement strings are both constant strings) becomes undecidable if we do not impose some kind of…
We consider Penrose limits of the Klebanov-Strassler and Maldacena-Nunez holographic duals to N =1 supersymmetric Yang-Mills. By focusing in on the IR region we obtain exactly solvable string theory models. These represent the…
We present the results of a high statistics analysis of smeared Wilson loops in 4 dimensional SU(N) Yang-Mills theory for various values of N. The data is used to analyze the behaviour of smeared Creutz ratios, extracting from them the…
Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…
We extend our previous work arXiv:1012.5721 [hep-th] on the non-compact N=2 SCFT_2 defined as the supersymmetric SL(2,R)/U(1)-gauged WZW model. Starting from path-integral calculations of torus partition functions of both the axial-type…
Based on the Breslauer-Italiano online suffix tree construction algorithm (2013) with double logarithmic worst-case guarantees on the update time per letter, we develop near-real-time algorithms for several classical problems on strings,…
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries:…