The frobenius problem

Abstract

This paper considers the “Frobenius problem” : Given n natural numbers a ₁, a ₂, ... a _n such that the greatest common divisor of a ₁,a ₂, ... a _n equal to 1, find the largest natural number that is not expressible as a nonnegative integer combination of them. This problem is NP-hard; but for the cases n=2, 3 polynomial time algorithms are known to solve it. Here a polynomial time algorithm is given for every fixed n. This is done by first proving an exact relation between the Frobenius problem and a geometric concept called the “covering radius”. Then a polynomial time algorithm is developed for finding the covering radius of any polytope in a fixed number of dimensions. The last algorithm relies on a structural theorem proved here that describes for any polytope K, the set K + Z ⁿ = {x : x ∈ R ⁿ; x = y + z; y ∈ K; z ∈ Z ⁿ∼. The proof of the structural theorem relies on some recent developments in the Geometry of Numbers. In particular, it draws on the notion of “width” and covering radius introduced in Kannan and Lovàsz [7], a theorem of Hastad [5] bounding the width of lattice-point-free convex bodies and the techniques of Kannan, Lovász and Scarf [8] to study the shapes of a polyhedron obtained by translating each facet parallel to itself. The concepts involved are defined from first principles.

Supported by NSF-Grant CCR 8805199.