{ "schema_version": 1, "n": 21, "group": { "kind": "cyclic", "invariant_factors": [ 21 ] }, "submitted_by": "vprusso", "submitted_at": "2026-10-29", "discovered_by": [ "Published searches surveyed in arXiv:1811.05094 (Szekeres 1988; Koukouvinos 1999; Georgiou, Koukouvinos, Stylianou 2002; Đoković and Kotsireas 2018; Bright, Đoković, Kotsireas, Ganesh 2019); enumerated here by the vxvware good census" ], "sources": [ { "title": "This board's pinned census good-census-c-v1, replayed at n=21", "url": "https://github.com/vxvware/goethals-seidel-challenge/blob/f9862dd59ab3f981e08810e66860ba84c9c2d782/research/starter/good/good_c.c", "commit": "f9862dd59ab3f981e08810e66860ba84c9c2d782", "source_path": "research/starter/good/good_c.c" }, { "title": "Bright, Đoković, Kotsireas, Ganesh, A SAT+CAS approach to finding good matrices: new examples and counterexamples (AAAI 2019), Table 1 and its survey of earlier searches", "url": "https://arxiv.org/abs/1811.05094" } ], "equivalence": "equiv-v1", "id": "good-n21", "type": "census", "stratum": "good", "representatives": [ "n21-098545d133609f790d6a", "n21-244dbc80f1864d4af916", "n21-43d1efdc8632d6b3db2e", "n21-50b4ce1ddefabb404d04", "n21-5332602e3986ea7453e9", "n21-733f29ff92163a76f47d", "n21-799990052fbd72980281", "n21-92e67d8c0e5ecd628b89", "n21-f2f8a1e5ce2c00056d7a", "n21-f73f09c99e3b8ca4fe76" ], "claimed_count": 10, "claim_kind": "computed-exact", "enumerator": "good-census-c-v1", "notes": "Full census replayed on this board by good-census-c-v1 on every verification. Before the engine was pinned its class sets were checked against the Python enumerator at orders 3 to 15, the stored saw-best-matrix censuses at 17 to 45, and the published counts of arXiv:1811.05094 at orders divisible by 3." }