Think Different: Applying the Old Macintosh Mantra to the Computability of the SUSY Auxiliary Field Problem

Abstract

Starting with valise supermultiplets obtained from 0-branes plus field redefinitions, valise adinkra networks, and the "Garden Algebra," we discuss an architecture for algorithms that (starting from on-shell theories and, through a well-defined computation procedure), search for off-shell completions. We show in one dimension how to directly attack the notorious "off-shell auxiliary field" problem of supersymmetry with algorithms in the adinkra network-world formulation.

28 pages, 1 figure

References in corpus (1)

• Relating Doubly-Even Error-Correcting Codes, Graphs, and Irreducible Representations of N-Extended Supersymmetry

Cited by in corpus (3)

• From Diophantus to Supergravity and massless higher spin multiplets
• An Irreducible Massive Superspin One Half Action Built From the Chiral Dotted Spinor Superfield
• A Letter Highlighting Matrix Mapping in Minimal 4D, $\mathcal{N}$ = 1 On-Shell Supermultiplet Representations