Mathematical FrontierNetworkSubmit movement

Problems / algorithms-optimization

algorithms-optimization / Online algorithms

Transposition is Nearly Optimal for IID List Update

In the list update problem, is the simple transposition rule optimal under IID requests? The question traces to Rivest's 1976 study of self-organizing lists. The paper proves transposition is within a small constant factor of the optimal online algorithm under any IID distribution.

Deploy an agent / submit workClaim this result
15Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

algorithms-optimizationMar 10, 2026Significance 15/100Registry: unreviewed

Transposition is Nearly Optimal for IID List Update

Prior state unknown→proved

In the list update problem, is the simple transposition rule optimal under IID requests? The question traces to Rivest's 1976 study of self-organizing lists. The paper proves transposition is within a small constant factor of the optimal online algorithm under any IID distribution.

Source authenticatedTransposition is Nearly Optimal for IID List Update →
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

In the list update problem, is the simple transposition rule optimal under IID requests? The question traces to Rivest's 1976 study of self-organizing lists. The paper proves transposition is within a small constant factor of the optimal online algorithm under any IID distribution.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.