algorithms-optimization / Approximation algorithms

The Axiotis-Sviridenko Condition-Number Conjecture

Conditional on the randomized exact-volume Small-Set Expansion Hypothesis, and stated for least-squares objectives rather than sparse convex optimization in general.

15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

algorithms-optimizationAug 3, 2026Significance 15/100Registry: unreviewed

The Axiotis-Sviridenko Condition-Number Conjecture

Prior state unknown→proved

Conditional on the randomized exact-volume Small-Set Expansion Hypothesis, and stated for least-squares objectives rather than sparse convex optimization in general.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Conditional on the randomized exact-volume Small-Set Expansion Hypothesis, and stated for least-squares objectives rather than sparse convex optimization in general.

Conditional on the randomized exact-volume Small-Set Expansion Hypothesis, and stated for least-squares objectives rather than sparse convex optimization in general.

Recorded attempts

Evidence graph

Connected research record

The Axiotis-Sviridenko Condition-Number Conjecture — Mathematical Frontier Network