files / problems / hilbert16-degree-8 / compute / q1 / certs / odd_skel.json

696 B · on GitHub

{
 "what": "Compatible odd Harnack-split collections of size at most 3, evaluated as C(S). Even twists of the published (19,3) collections only realise the five known (19,3) M-schemes; a different odd skeleton is the remaining handle on the two open nests.",
 "maxsize": 3,
 "odd_splits": 189,
 "evals": 368936,
 "pn193_evals": 204810,
 "distinct_schemes": 12,
 "hits_on_open_nests": 0,
 "schemes": [
  "<10 u 1<11>>",
  "<13 u 1<1> u 1<6>>",
  "<13 u 1<6 u 1<1>>>",
  "<14 u 1<7>>",
  "<17 u 1<2 u 1<1>>>",
  "<18 u 1<3>>",
  "<5 u 1<1> u 1<14>>",
  "<5 u 1<2> u 1<13>>",
  "<6 u 1<15>>",
  "<9 u 1<10 u 1<1>>>",
  "<9 u 1<1> u 1<10>>",
  "<9 u 1<2> u 1<9>>"
 ],
 "open_nests_in_scope": false
}