Related papers: Tight Additive Sensitivity on LZ-style Compressors…
Superconducting cosmic strings may be viewed as wires of thickness $1/\Lambda$ with $\Lambda=10^{16}$ TeV. We show that the weak interactions will spread out the current to distances $r= (1/M_Z)\ln (I/M_Z)$, where $I$ is the magnitude of…
Recently several studies have pointed out that gravitational-wave detectors are sensitive to ultralight vector dark matter and can improve the current best constraints given by the Equivalence Principle tests. While a gravitational-wave…
Entropy quantifies the number of bits required to store objects under certain given assumptions. While this is a well established concept for strings, in the context of tries the state-of-the-art regarding entropies is less developed. The…
In contrast to the old heterotic string case, the (weakly coupled) type I brane framework allows to have all, part or none of the standard model gauge group factors propagating in large extra--dimensions of TeV$^{-1}$ size. We investigate…
We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…
The repetition threshold for words on $n$ letters, denoted $\mbox{RT}(n)$, is the infimum of the set of all $r$ such that there are arbitrarily long $r$-free words over $n$ letters. A repetition threshold for circular words on $n$ letters…
In a seminal paper of Charikar et al. on the smallest grammar problem, the authors derive upper and lower bounds on the approximation ratios for several grammar-based compressors, but in all cases there is a gap between the lower and upper…
The longest common extension problem is to preprocess a given string of length $n$ into a data structure that uses $S(n)$ bits on top of the input and answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of the…
The derived modular invariant one-loop string effective coupling constant has been used to discuss the weak scale measurement constraints on minimal superstring models, minimal SUSY left-right string models and minimal left-right SUSY…
The measurement of anomalous gauge boson self couplings is reviewed for a variety of present and planned accelerators. Sensitivities are compared for these accelerators using models based on the effective Lagrangian approach. The…
Indexing of very large collections of strings such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT), and for this problem various in-memory…
The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family that exploits text repetitions in different ways. For each such compression…
Lyndon factorization and Lempel-Ziv (LZ) factorization are both important tools for analysing the structure and complexity of strings, but their combinatorial structure is very different. In this paper, we establish the first direct…
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,…
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses…
Random access to highly compressed strings -- represented by straight-line programs or Lempel-Ziv parses, for example -- is a well-studied topic. Random access to such strings in strongly sublogarithmic time is impossible in the worst case,…
Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the…
Low-scale string models are phenomenological models in String Theory, in which the string scale M_s is of the order of TeV. String excited states which are characteristic modes in low-scale string models can be observed as resonances in…
Compressed indexing is a powerful technique that enables efficient querying over data stored in compressed form, significantly reducing memory usage and often accelerating computation. While extensive progress has been made for…
We show that the BRST structure of the topological string is encoded in the ``small'' $N=4$ superconformal algebra, enabling us to obtain, in a non-trivial way, the string theory from hamiltonian reduction of $A(1|1)$. This leads to the…