Related papers: String Covering: A Survey
With our current level of understanding, the problem of making string theory predictions is not one of "solving" the theory, but rather of trying to determine whether there are any generic expectations. Within this context, we discuss what…
This review is devoted to strings and branes. Firstly, perturbative string theory is introduced. The appearance of various types of branes is discussed. These include orbifold fixed planes, D-branes and orientifold planes. The connection to…
In these lecture notes, an introduction to superstring theory is presented. Classical strings, covariant and light-cone quantization, supersymmetric strings, anomaly cancelation, compactification, T-duality, supersymmetry breaking, and…
We present an overview of both older and recent developments concerning scale separation in string theory. We focus on parametric scale separation obtained at the classical level in flux compactifications down to AdS vacua. We review the…
Determining whether an unordered collection of overlapping substrings (called shingles) can be uniquely decoded into a consistent string is a problem that lies within the foundation of a broad assortment of disciplines ranging from…
Recently it has been conjectured that string theory does not allow for dS vacua or dS extrema. To scrutinize such a conjecture, it is important to study concrete string theory compactifications and spell out their assumptions and potential…
This dissertation focuses on two fundamental sorting problems: string sorting and suffix sorting. The first part considers parallel string sorting on shared-memory multi-core machines, the second part external memory suffix sorting using…
We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a…
I review type IIB string compactifications in which the three-form field strengths satisfy a self-duality condition on the internal manifold. I begin with an overview of the models, giving preliminary formulae and several points of view…
Many machine learning libraries require that string features be converted to a numerical representation for the models to work as intended. Categorical string features can represent a wide variety of data (e.g., zip codes, names, marital…
We consider the classical exact multiple string matching problem. Our solution is based on $q$-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various…
As of today there exist consistent, gauge-invariant string field theories describing all string theories: bosonic open and closed strings, open superstrings, heterotic strings and type II strings. The construction of these theories require…
The pre-image problem has to be solved during inference by most structured output predictors. For string kernels, this problem corresponds to finding the string associated to a given input. An algorithm capable of solving or finding good…
Peptide strings have been developed as a concept for the past fourteen years. They are proposed to basically entail various quantum states engendered by the physical interactions of proteins containing peptide portions that are similar to…
Covers are a kind of quasiperiodicity in strings. A string $C$ is a cover of another string $T$ if any position of $T$ is inside some occurrence of $C$ in $T$. The shortest and longest cover arrays of $T$ have the lengths of the shortest…
Tries are popular data structures for storing a set of strings, where common prefixes are represented by common root-to-node paths. Over fifty years of usage have produced many variants and implementations to overcome some of their…
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in…
Text datasets can be represented using models that do not preserve text structure, or using models that preserve text structure. Our hypothesis is that depending on the dataset nature, there can be advantages using a model that preserves…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
String theory, if it describes nature, is probably strongly coupled. As a result, one might despair of making any statements about the theory. In the framework of a set of clearly spelled out assumptions, we show that this is not…