The Frobenius problem for classes of polynomial solvability.
Let \(A=\{a_1,\dots,a_n\}\) be positive integers with \(a_i\geq 2\) and such that their greatest common divisor is one. An integer \(s\) is representable as a nonnegative integral combination of \(a_1,\dots,a_n\) if there exist integers \(x_i\geq 0\) such that \(s=\sum^n_{i=1}x_ia_i\). The celebrated Frobenius problem is to find the largest natural number that is not representable as a nonnegative integral combination of \(a_1,\dots, a_n\). We denote by \(g(A)\) this number. In this paper, the author estimates \(g(A)\) when \(A\) is an almost chain sequence yielding to some formulas for particular sequences, for instance, for \(g(a,a+1,a+2, a+b, a+2b)\) where integers \(b<a\) and \(a+1\geq(1+b) \lfloor-\frac ab\rfloor\).
- Skolem's solution to a problem of Frobenius
- Frobenius numbers and automatic sequences
- An algorithm for solving the Frobenius problem using Gröbner bases
- The Frobenius Problem and Its Generalizations
- scientific article; zbMATH DE number 169254 (Why is no real title available?)
- An enumeration algorithm for all integers nonrepresentable by some positive integers
- The Frobenius problem in a free monoid
- Weighted Sylvester sums on the Frobenius set in more variables
- The Frobenius formula for \(A=(a,ha+d,ha+b_2 d, \ldots, ha+b_k d)\)
This page was built for publication: The Frobenius problem for classes of polynomial solvability.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810026)
