Better linear codes over GF(3) to GF(9), each with a minimum distance anyone can recompute, for the codetables.de tables.
-
Updated
Nov 1, 2026 - Python
Better linear codes over GF(3) to GF(9), each with a minimum distance anyone can recompute, for the codetables.de tables.
Re-checking the record covering system (minimum modulus 42) and searching for one with minimum modulus 43 (Erdős problem 2).
Matches anonymous music manuscripts in RISM to works by named composers, by their opening bars.
Computer-assisted proofs that published numerical periodic orbits of the three-body problem really exist.
Finds datasets that papers say were deposited but that are still unreleased, so the archives can follow them up.
Checks whether the formal (Lean) statements behind AI-claimed results say what their papers claim.
Can all 880 complex realizations of the 10-vertex rigid framework be real? Certified counts of real realizations of rigid graphs.
Computer-certified counts of the equilibrium shapes of n equal masses and of n identical point vortices.
Eclipsing binaries catalogued from old photographic plates that no longer eclipse in TESS.
Checking earlier claims against Gaia's fourth data release (2 Dec 2026): planets validated by machine learning, TESS candidates, long-period eclipsing binaries.
Ocean wave energy in 1962–78, measured from USGS scans of World-Wide Standardized Seismographic Network records.
Searching a century of Harvard photographic plates for unseen earlier eruptions of known novae.
To associate your repository with the foundation0 topic, visit your repo's landing page and select "manage topics."