Related papers: A Solver for a Theory of Strings and Bit-vectors
We review a progress in obtaining the complete non-perturbative effective action of type II string theory compactified on a Calabi-Yau manifold. This problem is equivalent to understanding quantum corrections to the metric on the…
A good automatic evaluation metric for language generation ideally correlates highly with human judgements of text quality. Yet, there is a dearth of such metrics, which inhibits the rapid and efficient progress of language generators. One…
We study the impact that string reversal can have on several repetitiveness measures. First, we exhibit an infinite family of strings where the number, $r$, of runs in the run-length encoding of the Burrows--Wheeler transform (BWT) can…
We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such formulas. Despite the long and successful history of SMT in…
A fundamental problem in contemporary string/M theory is to count the number of inequivalent vacua satisfying constraints in a string theory model. This article contains the first rigorous results on the number and distribution of…
Effective theories with the matter content of the minimal supersymmetric Standard Model below the string scale M_string predict a wrong value for the weak--mixing angle sin^2\theta_W and strong coupling constant \alpha_S at the scale M_Z.…
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…
String diagrams are an increasingly popular algebraic language for the analysis of graphical models of computations across different research fields. Whereas string diagrams have been thoroughly studied as semantic structures, much less…
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in…
SBV is a deep inference system that extends the set of logical operators of multiplicative linear logic with the non commutative operator Seq. We introduce the logical system SBVr which extends SBV by adding a self-dual atom-renaming…
Given a string $w$, another string $v$ is said to be a subsequence of $w$ if $v$ can be obtained from $w$ by removing some of its letters; on the other hand, $v$ is called an absent subsequence of $w$ if $v$ is not a subsequence of $w$. The…
The near horizon geometry of a fundamental string wrapped around an S1 reduced to four dimensions is expected to be AdS2 x S2. A probe string analysis suggests a no-force condition indicating supersymmetry, which coincides with the…
We derive a Kontsevich-type matrix model for the c=1 string directly from the W-infinity solution of the theory. The model that we obtain is different from previous proposals, which are proven to be incorrect. Our matrix model contains the…
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…
The paper [1] shows that simple linear classifier can compete with complex deep learning algorithms in text classification applications. Combining bag of words (BoW) and linear classification techniques, fastText [1] attains same or only…
We survey the different methods used for extending the BWT to collections of strings, following largely [Cenzato and Lipt\'ak, CPM 2022, Bioinformatics 2024]. We analyze the specific aspects and combinatorial properties of the resulting BWT…
Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of…
We consider a new 3-parameter class of exact 4-dimensional solutions in closed string theory and solve the corresponding string model, determining the physical spectrum and the partition function. The background fields (4-metric,…
We investigate a solution of the Weyl invariance conditions in open string theory in 4 dimensions. In the closed string sector this solution is a combination of the SU(2) Wess--Zumino--Witten model and a Liouville theory. The investigation…
The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m-1$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \mod m $, and to report such a…