Related papers: Matrix Models and Integrable C<1 Open String Theor…
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…
We propose a nonperturbative framework for the O(32) type I open and closed string theory. The short distance degrees of freedom are bosonic and fermionic hermitian matrices belonging respectively to the adjoint and fundamental…
We study open and unoriented strings in a Topological Membrane (TM) theory through orbifolds of the bulk 3D space. This is achieved by gauging discrete symmetries of the theory. Open and unoriented strings can be obtained from all possible…
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…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
This abstract aims at presenting an ongoing effort to apply a novel typing mechanism stemming from Implicit Computational Complexity (ICC), that tracks dependencies between variables in three different ways, at different stages of…
The technique of (discretised) light-cone quantisation, as applied to matrix models of relativistic strings, is reviewed. The case of the c=2 non-critical bosonic string is discussed in some detail to clarify the nature of the continuum…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
We present a class of solvable models that resemble string theories in many respects but have a strikingly different non-perturbative sector. In particular, there are no exponentially small contributions to perturbation theory in the string…
We review the basic principles of the construction of open and unoriented superstring models and analyze some representative examples.
We study the S-matrix elements of the gauge invariant operators corresponding to on-shell closed strings, in open string field theory. In particular, we calculate the tree level S-matrix element of two ${\it arbitrary}$ closed strings, and…
We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…
One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…
Many algorithms use data structures that maintain properties of matrices undergoing some changes. The applications are wide-ranging and include for example matchings, shortest paths, linear programming, semi-definite programming, convex…
We consider the conversion problem for multimodal type theory (MTT) by characterizing the normal forms of the type theory and proving normalization. Normalization follows from a novel adaptation of Sterling's Synthetic Tait Computability…
We present a new class of matrix models which are manifestly symmetric under the T-duality transformation of the target space. The models may serve as a nonperturbative regularization for the T-duality symmetry in continuum string theory.…
We revisit occurrence typing, a technique to refine the type of variables occurring in type-cases and, thus, capturesome programming patterns used in untyped languages. Although occurrence typing was tied from its inceptionto set-theoretic…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
Recent work on permutation-based model merging has shown impressive low- or zero-barrier mode connectivity between models from completely different initializations. However, this line of work has not yet extended to the Transformer…
Matrix string theory is equivalent to type IIA superstring theory in the light-cone gauge, together with extra degrees of freedom representing D-brane states. It is therefore the appropriate framework in which to study systems of multiple…