Finding the standard model of particle physics a combinatorial problem

Published: 1 February 2008| Version 1 | DOI: 10.17632/vdstdvbmgf.1
Jan-Hendrik Jureit, Christoph A. Stephan


Abstract We present a combinatorial problem which consists in finding irreducible Krajewski diagrams from finite geometries. This problem boils down to placing arrows into a quadratic array with some additional constraints. The Krajewski diagrams play a central role in the description of finite noncommutative geometries. They allow to localise the standard model of particle physics within the set of all Yang–Mills–Higgs models. Title of program: ko0 and ko6 Catalogue Id: ADZZ_v1_0 Nature of problem Automatised classification of almost-commutative geometries via Krajewski diagrams. Versions of this program held in the CPC repository in Mendeley Data ADZZ_v1_0; ko0 and ko6; 10.1016/j.cpc.2007.02.115 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computer Algebra System, Elementary Particle