Related papers: A solution manual for Polchinski's "String Theory"
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
Existence of open string field theory solutions describing configurations of multiple space-filling D-branes has been a subject of numerous speculations for quite some time. In this talk we present some new results giving further support to…
We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all, provides an optimal Steiner tree. Each IP is polynomial in the size of the underlying graph and our…
This is a brief description of what has been accomplished and what remains to be done in the construction of a nonperturbative formulation of "The Theory Formerly Known as String". It is culled from two short talks given by the author at…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
In these lectures we give a brief introduction to perturbative and non-perturbative string theory. The outline is the following: 1. Introduction to perturbative string theory 1.1 From point particle to extended objects 1.2 Free closed and…
A systematic literature review is a research process that identifies, evaluates, and interprets all relevant study findings connected to specific research questions, topics, or phenomena of interest. In this work, a thorough review of the…
We give an elementary introduction to classical and quantum bosonic string theory.
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Solutions to low energy string theory describing black holes and black strings are reviewed. Many of these solutions can be obtained by applying simple solution generating transformations to the Schwarzschild metric. In a few cases, the…
This Resource Letter provides a guide to some of the the introductory and review literature in string theory. It is in no way complete, though it is intended to be of use to students at several levels. Owing to the nature of the subject,…
We discuss progress and prospects in the application of bootstrap methods to string theory.
We review known exact classical solutions in (bosonic) string theory. The main classes of solutions are `cosets' (gauged WZW models), `plane wave'-type backgrounds (admitting a covariantly constant null Killing vector) and `$F$-models'…
We analyze the polynomial solutions of the linear differential equation $p_2(x)y''+p_1(x)y'+p_0(x)y=0$ where $p_j(x)$ is a $j^{\rm th}$-degree polynomial. We discuss all the possible polynomial solutions and their dependence on the…
{\bf Exact} solutions of the string equations of motion and constraints are {\bf systematically} constructed in de Sitter spacetime using the dressing method of soliton theory. The string dynamics in de Sitter spacetime is integrable due to…
In this note we construct exact solution of Berkovits'superstring field theory.
We give a mathematical perspective on string compactifications. Submitted as a chapter in the Encyclopedia of Mathematical Physics.
We investigate some versions of the famous 100 prisoner problem for the infinite case, where there are infinitely many prisoners and infinitely many boxes with labels. In this case, many questions can be asked about the admissible steps of…
The spectrum of a Polchinski-Strominger type effective string theory, extended to all orders, herein called an effective string theory of the \emph{Polyakov-Liouville Type} (for obvious reasons) is investigated to all orders in the small…
Correctly applying distributed systems concepts is important for software that seeks to be scalable, reliable and fast. For this reason, Distributed Systems is a course included in many Computer Science programs. To both describe current…