Universality and Clustering in 1+1 Dimensional Superstring-Bit Models

Abstract

We construct a 1+1 dimensional superstring-bit model for D=3 Type IIB superstring. This low dimension model escapes the problems encountered in higher dimension models: (1) It possesses full Galilean supersymmetry; (2) For noninteracting polymers of bits, the exactly soluble linear superpotential describing bit interactions is in a large universality class of superpotentials which includes ones bounded at spatial infinity; (3) The latter are used to construct a superstring-bit model with the clustering properties needed to define an $S$-matrix for closed polymers of superstring-bits.

11 pages, Latex document

References in corpus (2)

• String Bit Models for Superstring
• Calculating the Rest Tension for a Polymer of String Bits

Cited by in corpus (10)

• Theory of Ultracold Superstrings
• A Lie Algebra for Closed Strings, Spin Chains and Gauge Theories
• Symmetries of Large N Matrix Models for Closed Strings
• Supersymmetric Quantum Mechanics for String-Bits
• Stable String Bit Models
• Symmetry Algebras of Large-N Matrix Models for Open Strings
• The Size of a Polymer of String-Bits: A Numerical Investigation
• String Bits at Finite Temperature and the Hagedorn Phase
• Evidence for String Substructure
• Bits of String and Bits of Branes