Related papers: On Extensions of Maximal Repeats in Compressed Str…

We show that if DTIME[2^O(n)] is not included in DSPACE[2^o(n)], then, for every set B in PSPACE/poly, all strings x in B of length n can be represented by a string compressed(x) of length at most log(|B^{=n}|)+O(log n), such that a…

We revisit the problem of matching the strong coupling expansion of the $\frac{1}{2}$ BPS circular Wilson loops in ${\cal N}=4$ SYM and ABJM gauge theories with their string theory duals in ${\rm AdS}_5 \times S^5$ and ${\rm AdS}_4 \times…

A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating…

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

It has been shown that, regarding a terminating right-linear overlay term rewrite system (TRS), any rewrite sequence ending with a normal form can be simulated by the innermost reduction. In this paper, using this simulation property, we…

A new method is used to resolve a long-standing conjecture of Niho concerning the crosscorrelation spectrum of a pair of maximum length linear recursive sequences of length $2^{2 m}-1$ with relative decimation $d=2^{m+2}-3$, where $m$ is…

A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The notion of closed words was introduced by [Fici, WORDS 2011].…

The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources…

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 dual version of a conjecture by Woodall asserts that, in a planar digraph, the length of a shortest dicycle equals the maximum number of pairwise disjoint feedback arc sets. We verify this conjecture for the case where the underlying…

Let $K_{r_1,\ldots,r_s}$ denote the complete multipartite graph with class sizes $r_1,\ldots,r_s$ and let $K_s$ denote the complete graph of order $s$. In 2018, Luo determined the maximum number of $K_s$ in 2-connected graphs with a given…

Two independent criteria are presented that together guarantee exponential suppression of the two-loop cosmological constant in non-supersymmetric heterotic strings. They are derived by performing calculations in both the full string theory…

The known Lorentz invariant string field theory for open N=2 strings is combined with a generalization of the twistor description of anti-self-dual (super) Yang-Mills theories. We introduce a Chern-Simons-type Lagrangian containing twistor…

Let $\Sigma$ be an alphabet. For two strings $X$, $Y$, and a constrained string $P$ over the alphabet $\Sigma$, the constrained longest common subsequence and substring problem for two strings $X$ and $Y$ with respect to $P$ is to find a…

A correlation is a binary vector that encodes all possible positions of overlaps of two words, where an overlap for an ordered pair of words (u,v) occurs if a suffix of word u matches a prefix of word v. As multiple pairs can have the same…

We consider, in a string theory framework, physical processes of phenomenological interest in models with a low string scale. The amplitudes we study involve tree-level virtual gravitational exchange, divergent in a field-theoretical…

In this paper, considering the correspondence between spin chains and string sigma models, we explore the rotating string solutions over $ \eta $ deformed $ AdS_5 \times S^{5} $ in the so called fast spinning limit. In our analysis, we…

The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…

We show that introducing spin-singlet or spin-triplet superconductivity into twisted bilayer graphene induces higher-order topological superconductivity. $C_{2z}T$-protected corner states of Majorana Kramers pairs appear at the boundary…

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every…