| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655701 | Journal of Combinatorial Theory, Series A | 2011 | 7 Pages |
Abstract
Given a primitive positive integer vector a, the Frobenius number F(a) is the largest integer that cannot be represented as a non-negative integral combination of the coordinates of a. We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
