REVIEW 1 cited by
New lower bounds for the maximal determinant problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We report new world records for the maximal determinant of an n-by-n matrix with entries +/-1. Using various techniques, we beat existing records for n=22, 23, 27, 29, 31, 33, 34, 35, 39, 45, 47, 53, 63, 69, 73, 77, 79, 93, and 95, and we present the record-breaking matrices here. We conjecture that our n=22 value attains the globally maximizing determinant in its dimension. We also tabulate new records for n=67, 75, 83, 87, 91 and 99, dimensions for which no previous claims have been made. The relevant matrices in all these dimensions, along with other pertinent information, are posted at http://www.indiana.edu/~maxdet \.
Forward citations
Cited by 1 Pith paper
-
ThetaEvolve: Test-time Learning on Open Problems
ThetaEvolve enables small open-source LLMs to achieve new best-known bounds on open problems such as circle packing by combining test-time RL with a large program database and lazy penalties.
Discussion (0). Continue with ORCID to comment.