Papers › Simple deterministic O(n log n) algorithm finding a solution of Erdős-Ginzburg-Ziv theorem
Simple deterministic O(n log n) algorithm finding a solution of Erdős-Ginzburg-Ziv theorem
Seokhwan Choi, Hanpil Kang, Dongjae Lim
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Erd\H{o}s-Ginzburg-Ziv theorem is a famous theorem in additive number theory, which states any sequence of 2n-1 integers contains a subsequence of n elements, with their sum being a multiple of n. In this article, we provide an algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv theorem in 𝒪(n logn) time. This is the first known deterministic 𝒪(n logn) time algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv theorem.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections