census · order 63
williamson-n63
reproducedOrigin not yet classified
Original source attribution: Bright, Kotsireas, Ganesh 2018 SAT+CAS classification of odd orders divisible by three; the Turyn-type class credited there
Submitted / imported by: vprusso · 2026-11-12
Board cell: Williamson (ssss)
Entry file: census/williamson-n63.json · raw JSON
Notes
The paper's exhaustive enumeration at order 63 (two inequivalent sets); its representatives are verified here and pairwise inequivalent, but the search has not been replayed on this board, so the count is recorded as a lower bound until a replay is registered.
Checks and result
{
"id": "williamson-n63",
"type": "census",
"n": 63,
"stratum": "williamson",
"equivalence": "equiv-v1",
"count": 2,
"bound": "exact",
"tier": "reproduced",
"claimed_count": 2,
"claim_kind": "published-exact",
"checks": [
"pairwise-inequivalence",
"registered-full-census-replay",
"representative-existence"
],
"replay": {
"engine_id": "williamson-compress-v1",
"compression": 3,
"host": "bos-game",
"threads": 16,
"date": "2026-11-12",
"wall_seconds": 12186.8,
"raw_rows": 6
},
"limitations": [
"Full offline replay of a pinned engine, re-derived from its raw rows here; the same engine can reproduce its own systematic bugs."
],
"contributions": []
}Sources
- Bright, Kotsireas, Ganesh, Applying computer algebra systems with SAT solvers to the Williamson conjecture, J. Symbolic Comput. (2020), Table 3 [5]
Submission JSON
{
"schema_version": 1,
"n": 63,
"group": {
"kind": "cyclic",
"invariant_factors": [
63
]
},
"submitted_by": "vprusso",
"submitted_at": "2026-11-12",
"discovered_by": [
"Bright, Kotsireas, Ganesh 2018 SAT+CAS classification of odd orders divisible by three; the Turyn-type class credited there"
],
"sources": [
{
"title": "Bright, Kotsireas, Ganesh, Applying computer algebra systems with SAT solvers to the Williamson conjecture, J. Symbolic Comput. (2020), Table 3",
"url": "https://cs.uwaterloo.ca/~cbright/reports/jsc-willsat.pdf"
}
],
"equivalence": "equiv-v1",
"id": "williamson-n63",
"type": "census",
"stratum": "williamson",
"representatives": [
"n63-7e4ff9b08623ad806bc6",
"n63-fa89dca8eb9c12dbbd69"
],
"claimed_count": 2,
"claim_kind": "published-exact",
"notes": "The paper's exhaustive enumeration at order 63 (two inequivalent sets); its representatives are verified here and pairwise inequivalent, but the search has not been replayed on this board, so the count is recorded as a lower bound until a replay is registered."
}