Karlsson matrices and the kagome lattice Astra, Banica and Fable 006.tex at the root contains the paper, figures and references. The accompanying code is a selection from https://github.com/teobanica/006. The Karlsson orbital check (Section 6.2) and the kagome staircase test (Section 5.4) are independent programs. The Le Banner files (Section 5.5) give the seven-letter weights, the verifier, the recorded verification and the program that can regenerate the closed-word representatives. Source listings are supplied as plain text. Starting in the extracted archive root, these commands restore the program filenames locally: for f in anc/code/*/*.py.txt anc/code/*/*/*.py.txt anc/code/*/*/*.cpp.txt; do [ -f "$f" ] && cp "$f" "${f%.txt}" done Two quick checks with Python 3 (the staircase test uses NumPy): python3 anc/code/checks/orbitals.py python3 anc/code/overgroup/staircase.py 5 9 For the full level-15 computation, use NumPy, SciPy and a C++17 compiler. To generate the large representative list locally and verify the certificate: (cd anc/code/laptops/level15 && python3 -c 'import lebanner; lebanner.classes(15)') cp anc/code/laptops/level15/lebanner-output/lebanner-15-classes.npy anc/code/overgroup/level15/ (cd anc/code/overgroup/level15 && OPENBLAS_NUM_THREADS=3 VECLIB_MAXIMUM_THREADS=3 python3 lebanner-check.py) The recorded run gives 7,751,763 classes, accounting for 928,353,697 closed words. The minimum score is 75 and 15 times the reference mean is strictly below 48.