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

TL;DR

This paper develops a 1+1 dimensional superstring-bit model for D=3 Type IIB superstring that exhibits universality, clustering, and supersymmetry, addressing issues faced in higher-dimensional models.

Contribution

It introduces a low-dimensional superstring-bit model with full Galilean supersymmetry and universal superpotentials enabling the construction of an S-matrix.

Findings

Model possesses full Galilean supersymmetry.

Superpotentials form a large universality class including bounded ones.

Constructed superstring-bit model exhibits clustering properties.

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.