Dense Graphs, Node Sets, and Riders: Toward a Foundation for Particle Physics without Continuum Mathematics
Alexander G. D. Lamb
1545 Scenic Avenue
Berkeley, CA 94708, USA
alex.lamb@gmail.com
Abstract
Digital physics seeks to help answer problematic open questions in quantum gravity by bringing to bear techniques from computer science. One approach to this endeavor is the creation of a toolbox of algorithms that can reliably simulate basic quantum phenomena. To facilitate this goal, we explore the extent to which set-based, pseudo-particle algorithms and dense, irregular graphs can be made to emulate the behaviors of naturally occurring fundamental particles. We investigate the relation between dense graphs and pseudo-particles traversing them, which has profound implications for limits on particle information and may provide an experimental tool for testing the geometric properties of quantized space. We also show that behaviors with properties such as particle polarization are easy to generate with this approach.
