Related papers: A Solver for a Theory of Strings and Bit-vectors
String breaking is at the core of hadronization models of relevance to particle colliders. Yet, studies of string-breaking dynamics rooted in quantum chromodynamics remain fundamentally challenging. Tensor networks enable sign-problem-free…
The Burrows-Wheeler Transform is a string transformation that plays a fundamental role for the design of self-indexing compressed data structures. Over the years, researchers have successfully extended this transformation outside the…
The conventional quantization of w_3 strings gives theories which are equivalent to special cases of bosonic strings. We explore whether a more general quantization can lead to new generalized W_3 string theories by seeking to construct…
Bit-vector formulas arising from hardware verification problems often contain word-level arithmetic operations. Empirical evidence shows that state-of-the-art SMT solvers are not very efficient at reasoning about bit-vector formulas with…
The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity measures between them, based on the observation that the more…
We consider classical and quantum strings in the conformally invariant background corresponding to the SL(2,R) WZWN model. This background is locally anti-de Sitter spacetime with non-vanishing torsion. Conformal invariance is expressed as…
We construct a new class of exact string solutions with a four dimensional target space metric of signature ($-,+,+,+$) by gauging the independent left and right nilpotent subgroups with `null' generators of WZNW models for rank 2…
We carefully examine the Polyakov path integral for strings on $\text{AdS}_3$ in superspace, both for type II and heterotic superstrings. We construct a free-field realization of the supersymmetric $\text{SL}(2,\mathbb{R})$ WZW model which…
The field of succinct data structures has flourished over the last 16 years. Starting from the compressed suffix array (CSA) by Grossi and Vitter (STOC 2000) and the FM-index by Ferragina and Manzini (FOCS 2000), a number of generalizations…
These proceedings start with a discussion of my recent experiences with large language models and potential implications for their usage in our field. This is followed by an AI generated summary of my talk at the workshop ``Recent Progress…
We review explicitly known exact $D=4$ solutions with Minkowski signature in closed bosonic string theory. Classical string solutions with space-time interpretation are represented by conformal sigma models. Two large (intersecting) classes…
We define string geometry: spaces of superstrings including the interactions, their topologies, charts, and metrics. Trajectories in asymptotic processes on a space of strings reproduce the right moduli space of the super Riemann surfaces…
In this paper, we explore worst-case solutions for the problems of single and multiple matching on strings in the word RAM model with word length w. In the first problem, we have to build a data structure based on a pattern p of length m…
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and…
Currently, string theory represents the only advanced approach to a unification of all interactions, including gravity. In spite of the more than thirty years of its existence it did not make any empirically testable predictions. And it is…
The solution term by term to the scattering of all consistent string theories is given. The moduli space of M-theory is derived and connects the various string theories. The solutions contain both the perturbative and non-perturbative…
String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…
The grading Becchi-Rouet-Stora-Tyutin (BRST) method gives a way to construct the integer $W_{2,s}$ strings, where the BRST charge is written as $Q_B=Q_0+Q_1$. Using this method, we reconstruct the nilpotent BRST charges $Q_{0}$ for the…
In scientific fields such as quantum computing, physics, chemistry, and machine learning, high dimensional data are typically represented using sparse tensors. Tensor contraction is a popular operation on tensors to exploit meaning or alter…
Solving avoidability problems in the area of string combinatorics often requires, in an initial step, the construction, via a computer program, of a very long word that does not contain any word that matches a given pattern. It is well…