UNIVERSALITY AND CLUSTERING IN 1-DIMENSIONAL SUPERSTRING-BIT MODELS(1)

We construct a 1 + 1 dimensional superstring-bit model for D = 3 type IIB superstring. This low dimension model escapes the problems encount ered in higher dimension models: (1) It possesses full Galilean supers ymmetry. (2) For noninteracting polymers of bits, the exactly soluble linear superpotential describing bit interactions is in a large univer sality class of superpotentials which includes ones bounded at spatial infinity. (3) The latter are used to construct a superstring-bit mode l with the clustering properties needed to define an S matrix for clos ed polymers of superstring bits.