Spherical codes and designs
Kissing configurations and spherical t-designs with more points than any known (placeholder)
1/6instances checked
Kissing configurations and spherical t-designs with more points than any known (placeholder)
Better configurations for Heilbronn’s triangle problem in the unit square, n = 11–14
Shorter tours than nearest neighbour on six point sets, scored by the demo runner
Certified upper bounds on Heilbronn’s Δ(n) for n = 11–14
Fewer two-qubit gates on a heavy-hex device, with equivalence checked (placeholder)