A bstract 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.
展开▼
机译:从0-Branes Plus Field Redefinition,Valise Adinkra Network和“Garden Algebra”获得的Valise SuperMultipls开始的Bstract从谷物和“花园代数”,我们讨论了(从壳牌理论开始,通过明确定义的计算过程)讨论了算法的架构,搜索外壳完成。我们在一个维度中展示了如何直接攻击Adinkra网络世界制定中的算法的臭名昭着的“离壳辅助领域”问题。
展开▼