Papers
Topics
Authors
Recent
Search
2000 character limit reached

Undirected Network Coding and Faster External-Memory Integer Sorting

Published 14 Oct 2026 in cs.DS, cs.CC, and cs.IT | (2610.20079v1)

Abstract: Network coding allows intermediate nodes to combine messages, whereas routing only forwards them. The Li-Li conjecture asserts that network coding and fractional routing have the same capacity region in undirected multiple-unicast networks. We give a counterexample to this conjecture and apply it to external-memory integer sorting. Since Aggarwal and Vitter posed the question in 1988, whether integer sorting can beat the external-memory comparison bound has remained a central and extensively studied open problem. We give a deterministic sorting algorithm: for NN integers of Θ(log⁡N)Θ(\log N) bits, a memory holding MM integers, and block transfers of BB integers, where 2B≤M≤N2B\le M\le N, the number of block transfers is O(NB[1+log⁡N(log⁡(M/B))1−ε(log⁡M)ε])O\left(\frac{N}{B}\left[1+\frac{\log N}{(\log(M/B))^{1-\varepsilon}(\log M)^\varepsilon}\right]\right), where ε>0\varepsilon>0 is an absolute constant. In a range of parameter regimes, this bound is asymptotically smaller than the classical comparison-sorting bound. We also use Lean 4 to verify the sorting algorithm's correctness and complexity bounds, and the strict advantage of coding over routing.

Authors (3)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.