Dual AI agents (coding and theory) discover convex relaxations improving certified lower bounds on the first autocorrelation inequality (C6.2) to 1.2937 and Erdős minimum-overlap constant (C6.5) to 0.37912, verified by dual-feasible points in interval arithmetic.
should I keep going?
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
AI-Assisted Discovery of Convex Relaxations via Dual Agents
Dual AI agents (coding and theory) discover convex relaxations improving certified lower bounds on the first autocorrelation inequality (C6.2) to 1.2937 and Erdős minimum-overlap constant (C6.5) to 0.37912, verified by dual-feasible points in interval arithmetic.