Using ' Cut and Paste ' technique, we develop a thin shell wormhole in heterotic string theory. We determine the surface stresses, which are localized in the shell, by using Darmois-Israel formalism. The linearized stability of this thin wormhole is also analyzed.

A branch-and-cut algorithm for the capacitated profitable tour problem.

We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and well-known integer polytopes — the cut, boolean quadric, multicut and clique partitioning polytopes — are shown to arise as projections of binary psd polyt...

The motivation for Core Logic is explained. Its system of proof is set out. It is then shown that, although the system has no Cut rule, its relation of deducibility obeys Cut with epistemic gain. §1. The debate over logical reform. There is much dispute over which logic is the right logic—indeed, over whether there could even be such a thing as the right logic, rather than a spectrum of logics ...

In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere S in such a way that two vertices joined by an edge have distance more than √ 3 (i.e. distance more than 2π/3 on the sphere). In 1978, D. Larman [4] disproved this conjecture, constructing a triangle-free graph for which the minimum length of an edge could not exceed p 8/3. In addition, he conjectured ...