Commutative algebra and the linear Diophantine problem of Frobenius

From MaRDI portal



Abstract: Let A be a finite set of relatively prime positive integers, and let S(A) be the set of all nonnegative integral linear combinations of elements of A. The set S(A) is a semigroup that contains all sufficiently large integers. The largest integer not in S(A) is the Frobenius number of A, and the number of positive integers not in S(A) is the genus of A. Sharp and Sylvester proved in 1884 that the Frobenius number of the set A=a,b is ab−a−b, and that the genus of A is (a−1)(b−1)/2. Graded rings and a simple form of Hilbert's syzygy theorem are used to give a commutative algebra proof of this result.











This page was built for publication: Commutative algebra and the linear Diophantine problem of Frobenius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383242)