Unbounded discrepancy in Frobenius numbers
Abstract
Let gj denote the largest integer that is represented exactly j times as a non-negative integer linear combination of x1, ... , xn. We show that for any k > 0, and n = 5, the quantity g0 - gk is unbounded. Furthermore, we provide examples with g0 > gk for n >= 6 and g0 > g1 for n >= 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.