Related papers: A solution manual for Polchinski's "String Theory"
This list presents problems in the Reverse Mathematics of infinitary Ramsey theory which I find interesting but do not personally have the techniques to solve. The intent is to enlist the help of those working in Reverse Mathematics to take…
This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of…
We reinterpret N=(2,1) strings as describing the continuum limit of matrix theory with all spatial dimensions compactified. Thus they may characterize the full set of degrees of freedom needed to formulate the theory.
Denote by $\text{PS}(\alpha)$ the image of the Piatetski-Shapiro sequence $n \mapsto \lfloor n^{\alpha} \rfloor$ where $\alpha > 1$ is non-integral and $\lfloor x \rfloor$ is the integer part of $x \in \mathbb{R}$. We partially answer the…
Analyzed models of learning, which take into account that: 1) the rate of increase of student's knowledge is proportional to the difference between levels of teacher's requirements and prior knowledge; 2) if the requirements are too high,…
We investigate the Polchinski ERG equation for d-dimensional O(N) scalar field theory. In the context of the non-perturbative derivative expansion we find families of regular solutions and establish their relation with the physical fixed…
We revisit the spectrum of closed strings in the Lorentzian signature 2D black hole in string theory. Using the description of the black hole as a gauged WZNW model, we argue that the spectrum of the closed strings contain states from the…
This is a self-contained pedagogical review of Polchinski's 1986 analysis from first principles of the Polyakov path integral based on Hawking's zeta function regularization technique for scale-invariant computations in two-dimensional…
We show that the equations underlying the $GW$ approximation have a large number of solutions. This raises the question: which is the physical solution? We provide two theorems which explain why the methods currently in use do, in fact,…
We develop a comprehensive string diagrammatic treatment of electrical circuits. Building on previous, limited case studies, we introduce controlled sources and meters as elements, and the impedance calculus, a powerful toolbox for…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…
We apply non-linear WKB analysis to the study of the string equation. Even though the solutions obtained with this method are not exact, they approximate extremely well the true solutions, as we explicitly show using numerical simulations.…
In hep-th/0411017 the Polchinski-Strominger effective string model was examined and it was shown there that the spectrum of excitations is universal up to and including terms of order $R^{-3}$ in the long distance expansion. Subsequently…
Motivated by the recent interest in the different aspects of the string/field theory duality, we describe an approach for obtaining exact string solutions in general backgrounds, based on two types of string embedding, allowing for…
The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…
Exact string matching has been a fundamental problem in computer science for decades because of many practical applications. Some are related to common procedures, such as searching in files and text editors, or, more recently, to more…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
This is a summary of a talk at Strings2000 explaining three ways in which string theory and M-theory are related to the mathematics of K-theory.
An overview of supersymmetry and its different applications is presented. We motivate supersymmetry in particle physics. We then explain how supersymmetry helps us analyze field theories exactly, and what dynamical lessons these solutions…