hunting-hadamards
quadruple · order 21

n21-50b4ce1ddefabb404d04

rows verified

Origin not yet classified

Original source attribution: 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
Submitted / imported by: vprusso · 2026-10-29
Board cell: Good (ksss), With a skew block, Any
Entry file: quadruples/n21-50b4ce1ddefabb404d04.json · raw JSON

Rows

The four rows A, B, C, D of the canonical representative, with + for 1 and - for −1. The letter after each name is its symmetry: k skew, s symmetric, · neither. A skew row is listed first, so the Goethals–Seidel array of the rows in this order is a skew-Hadamard matrix of order 84. The verifier result below lists the same rows as canonical_rows in sorted order, in which the skew row is not first.

A k +----+--++-+--++-++++
B s +-----+-+-++-+-+-----
C s +-++---+--++--+---++-
D s +-+++++---++---+++++-

Picture

Checks and result

{
  "id": "n21-50b4ce1ddefabb404d04",
  "type": "quadruple",
  "n": 21,
  "group": {
    "kind": "cyclic",
    "invariant_factors": [
      21
    ]
  },
  "tracks": [
    "good",
    "skew-sds",
    "general"
  ],
  "tier": "reproduced",
  "checks": [
    "integer-domain",
    "exact-PAF",
    "symmetry",
    "canonical-form"
  ],
  "equivalence": "equiv-v1",
  "fingerprint": "gs-50b4ce1ddefabb404d0411b96f619cae3aa083beb5c888ec54fb39a30641da8c",
  "canonical_rows": [
    [
      1,
      -1,
      -1,
      -1,
      -1,
      -1,
      1,
      -1,
      1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      1,
      -1,
      -1,
      -1,
      -1,
      -1
    ],
    [
      1,
      -1,
      -1,
      -1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      1,
      1,
      1,
      1
    ],
    [
      1,
      -1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      -1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      -1
    ],
    [
      1,
      -1,
      1,
      1,
      1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      1,
      1,
      1,
      -1
    ]
  ],
  "row_sums": [
    -7,
    1,
    -3,
    5
  ],
  "pattern": "skss",
  "flags": [],
  "contributions": []
}

Sources

Submission JSON
{
  "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": "n21-50b4ce1ddefabb404d04",
  "type": "quadruple",
  "rows": [
    [
      1,
      -1,
      -1,
      -1,
      -1,
      -1,
      1,
      -1,
      1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      1,
      -1,
      -1,
      -1,
      -1,
      -1
    ],
    [
      1,
      -1,
      -1,
      -1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      1,
      1,
      1,
      1
    ],
    [
      1,
      -1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      -1,
      -1,
      1,
      1,
      -1,
      -1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      -1
    ],
    [
      1,
      -1,
      1,
      1,
      1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      -1,
      -1,
      -1,
      1,
      1,
      1,
      1,
      1,
      -1
    ]
  ]
}