Related papers: Matrix Models and Integrable C<1 Open String Theor…
We propose an off-shell bosonic string action that removes the renormalization window constraint of [1]. To all orders in conformal perturbation theory, this action allows for deformations of the worldsheet theory by any primary or…
Current research on the advantages and trade-offs of using characters, instead of tokenized text, as input for deep learning models, has evolved substantially. New token-free models remove the traditional tokenization step; however, their…
We study the question of whether the "termination with probability 1" property of a randomized algorithm is preserved when one replaces the atomic registers that the algorithm uses with linearizable (implementations of) registers. We show…
This paper deals with strong structural controllability of linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. Instead of assuming that the nonzero and arbitrary entries of the system…
We propose a new formulation of the space-time interpretation of the $c=1$ matrix model. Our formulation uses the well-known leg-pole factor that relates the matrix model amplitudes to that of the 2-dimensional string theory, but includes…
We construct classical solutions of open string field theory which are not invariant under ordinary twist operation. From detailed analysis of the moduli space of the solutions, it turns out that our solutions become nontrivial at…
In this article, we investigate the supersymmetric c=1 model of superstring theory and demonstrate how the spectrum of states is expanded and new symmetries of the theory are generated by the existence of ghost cohomologies. As a result, we…
Implicit heterogeneous metaprogramming (a.k.a. offshoring) is an attractive approach for generating C with some correctness guarantees: generate OCaml code, where the correctness guarantees are easier to establish, and then map that code to…
We study the Schwinger-Dyson equations of a matrix model for an open-closed string theory. The free energy with source terms for scaling operators satisfies the same Virasoro conditions as those of the pure closed string and is obtained…
In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory $\mathcal{T}_0$ with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which…
We present a non-perturbative solution of large $N$ matrix models modified by terms of the form $ g(\Tr\Phi^4)^2$, which add microscopic wormholes to the random surface geometry. For $g<g_t$ the sum over surfaces is in the same universality…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
In an attempt to uncover any underlying structure in the neutrino mass matrix, we discuss the possibility that the ratios of elements of its Majorana mass matrix are equal. We call this "strong scaling Ansatz" for neutrino masses and study…
In a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.…
We revisit the perturbative S-matrix of c=1 string theory from the worldsheet perspective. We clarify the origin of the leg pole factors, the non-analyticity of the string amplitudes, and the validity as well as limitations of earlier…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
In many real-world scenarios, data to train machine learning models becomes available over time. Unfortunately, these models struggle to continually learn new concepts without forgetting what has been learnt in the past. This phenomenon is…
Krebs et al. (2007) gave a characterization of the complexity class TC0 as the class of languages recognized by a certain class of typed monoids. The notion of typed monoid was introduced to extend methods of algebraic automata theory to…
Keeping in mind the several models of M(atrix) theory we attempt to understand the possible structure of the topological M(atrix) theory ``underlying'' these approaches. In particular we raise the issue about the nature of the structure of…
The perturbative analysis of models of open and closed superstrings presents a number of surprises. For instance, variable numbers of antisymmetric tensors ensure their consistency via generalized Green-Schwarz cancellations and a novel…