Unbounded Discrepancy in Frobenius Numbers

@inproceedings{Shallit2011UnboundedDI,
  title={Unbounded Discrepancy in Frobenius Numbers},
  author={Jeffrey Shallit and James Stankewicz},
  booktitle={Integers},
  year={2011}
}
Abstract Let gj denote the largest integer that is represented exactly j times as a non-negative integer linear combination of {x 1, . . . , xn }. We show that for any k > 0, and n = 5, the quantity g 0 – gk is unbounded. Furthermore, we provide examples with g 0 > gk for n ≥ 6 and g 0 > g 1 for n ≥ 4. 

Topics from this paper

Bounds on generalized Frobenius numbers
TLDR
This paper uses techniques from the geometry of numbers to give upper and lower bounds on the s -Frobenius number for any nonnegative integer s .
BOUNDS ON GENERALIZED FROBENIUS NUMBERS LENNY FUKSHANSKY AND
Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. The Frobenius number of this N -tuple is defined to be the largest positive integer that has no representation as PN i=1 aixi where
An Extreme Family of Generalized Frobenius Numbers
TLDR
A family of integers is constructed, based on a recent paper by Tripathi, whose generalized Frobenius numbers g 0, g 1, g 2, . . . exhibit unnatural jumps, and any integer larger than has at least representations.
# A 24 INTEGERS 11 ( 2011 ) AN EXTREME FAMILY OF GENERALIZED FROBENIUS NUMBERS
We study a generalization of the Frobenius problem: given k positive relatively prime integers, what is the largest integer g 0 that cannot be represented as a nonnega-tive integral linear
Frobenius Coin-Exchange Generating Functions
TLDR
A similar closed form is established for the generating function indicating all integers with exactly k representations, with similar wide-ranging corollaries for the Frobenius problem.
The generalized Frobenius problem via restricted partition functions
Given relatively prime positive integers, $a_1,\ldots,a_n$, the Frobenius number is the largest integer with no representations of the form $a_1x_1+\cdots+a_nx_n$ with nonnegative integers $x_i$.
Frobenius numbers, Sylvester numbers and sums associated with number of solutions
Let a1, a2, . . . , ak be positive integers with gcd(a1, a2, . . . , ak) = 1. Frobenius number is the largest positive integer that is NOT representable in terms of a1, a2, . . . , ak. When k ≥ 3,
The Coin-Exchange Problem of Frobenius
Suppose we are interested in an infinite sequence of numbers \(\left (a_{k}\right )_{k=0}^{\infty }\) that arises naturally from geometric problems, or from recursively defined problems. Is there a
Finite Fourier Analysis
We now consider the vector space of all complex-valued periodic functions on the integers with period b. It turns out that every such function a(n) on the integers can be written as a polynomial in
Counting Lattice Points in Polytopes: The Ehrhart Theory
Given the profusion of examples that gave rise to the polynomial behavior of the integer-point counting function \(L_{\mathcal{P}}(t)\) for special polytopes \(\mathcal{P}\), we now ask whether there
...
1
2
3
...

References

SHOWING 1-5 OF 5 REFERENCES
An Extreme Family of Generalized Frobenius Numbers
TLDR
A family of integers is constructed, based on a recent paper by Tripathi, whose generalized Frobenius numbers g 0, g 1, g 2, . . . exhibit unnatural jumps, and any integer larger than has at least representations.
On a Generalization of the Frobenius Number
We consider a generalization of the Frobenius problem, where the object of interest is the greatest integer having exactly j representations by a collection of positive relatively prime integers. We
The diophantine frobenius problem
Preface Acknowledgements 1. Algorithmic Aspects 2. The Frobenius Number for Small n 3. The General Problem 4. Sylvester Denumerant 5. Integers without Representation 6. Generalizations and Related
Extending the Linear Diophantine Problem of Frobenius
Ramı́rez Alfonśın. The Diophantine Frobenius Problem
  • 2005