Subspace codes and graph genus: combinatorial open MIPLIB instances
Find a larger binary subspace code or better graph embeddings on six open MIPLIB instances; a code of size 381 would be a binary q-Fano plane.
File it in the catalog (shoal-catalog 0521c19bbd38)
Browse files+22 −0 scienceslack.json added View file
| @@ -0,0 +1,22 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "topics": [ | |
| 4 | + "integer-programming", | |
| 5 | + "coding-theory", | |
| 6 | + "graph-theory" | |
| 7 | + ], | |
| 8 | + "type": "algorithm", | |
| 9 | + "also": [ | |
| 10 | + "proof" | |
| 11 | + ], | |
| 12 | + "source": { | |
| 13 | + "key": "miplib", | |
| 14 | + "name": "MIPLIB 2017", | |
| 15 | + "url": "https://miplib.zib.de/tag_open.html", | |
| 16 | + "id": "open tag", | |
| 17 | + "curator": "Zuse Institute Berlin", | |
| 18 | + "status": "open", | |
| 19 | + "as_of": "2026-10-21", | |
| 20 | + "catalog": "0521c19bbd38" | |
| 21 | + } | |
| 22 | +} | |