Papers › Lower Bounds of Functions on Finite Abelian Groups
Lower Bounds of Functions on Finite Abelian Groups
Jiangting Yang, Ke Ye, Lihong Zhi
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.
The problem of computing the optimum of a function on a finite set is an important problem in mathematics and computer science. Many combinatorial problems such as MAX-SAT and MAXCUT can be recognized as optimization problems on the hypercube C₂ⁿ = {-1,1}ⁿ consisting of 2ⁿ points. It has been noticed that if a finite set is equipped with an abelian group structure, then one can efficiently certify nonnegative functions on it by Fourier sum of squares (FSOS). Motivated by these works, this paper is devoted to developing a framework to find a lower bound of a function on a finite abelian group efficiently. We implement our algorithm by the SDP solver SDPNAL+ for computing the verified lower bound of f on G and test it on the MAX-2SAT and MAX-3SAT benchmark problems from the Max-SAT competitions in 2009 and 2016. Beyond that, we also test our algorithm on random functions on C₃ⁿ. These experiments demonstrate the advantage of our algorithm over previously known methods.
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