Related papers: From Numbers to Container Strings
In some string theories, e.g. SO(32) heterotic string theory on Calabi-Yau manifolds, a massless field with a tree level potential can acquire a tachyonic mass at the one loop level, forcing us to quantize the theory around a new background…
We analyze the set of increasingly enumerable additive submonoids of R, for instance, the set of logarithms of the positive integers with respect to a given base. We call them $\omega$-monoids. The $\omega$-monoids for which consecutive…
In this article, prepared for the book "The birth of string theory", I recall the sequence of ideas which led to non-critical strings and gauge/strings duality. I also comment on some promising future directions.
A discrete string theory --a theory of embeddings from ${\bf Z}\times {\bf Z}_C\to {\bf R}^D$, where $C$ is the number of components of the string-- is explored. The closure of the algebra of constraints (`${\bf Z}_C$-Virasoro algebra') is…
String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. We show that a…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…
We discuss the continuum field theory limit of the physical scenario described in Ref. [1], the universe arising from the interpretation of the most general collection of logical codes in terms of distributions of units of energy along…
We provide an overview of the hybrid compositional distributional model of meaning, developed in Coecke et al. (arXiv:1003.4394v1 [cs.CL]), which is based on the categorical methods also applied to the analysis of information flow in…
Distributions on integers are ubiquitous in probabilistic modeling but remain challenging for many of today's probabilistic programming languages (PPLs). The core challenge comes from discrete structure: many of today's PPL inference…
In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code,…
We study a $U(N)$-invariant vector+matrix chain with the color structure of a lattice gauge theory with quarks and interpret it as a theory of open andclosed strings with target space $\Z$. The string field theory is constructed as a…
Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical…
When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct…
Call a string-to-string transducer regular if it can be realised by one of the following equivalent models: mso transductions, two-way deterministic automata with output, and streaming transducers with registers. This paper proposes to…
Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…
Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure. Using this new syntax we formulate an automatic differentiation algorithm…
We use the term protocol coding to denote the communication strategies in which information is encoded through the actions taken by a certain communication protocol. In this work we investigate strategies for protocol coding via…