Commutative algebra and the linear diophantine problem of Frobenius

preprint2016arXivOpen access

Abstract

Let AA be a finite set of relatively prime positive integers, and let S(A)S(A) be the set of all nonnegative integral linear combinations of elements of AA. The set S(A)S(A) is a semigroup that contains all sufficiently large integers. The largest integer not in S(A)S(A) is the Frobenius number of AA, and the number of positive integers not in S(A)S(A) is the genus of AA. Sharp and Sylvester proved in 1884 that the Frobenius number of the set A={a,b}A = \{a,b\} is ab−a−bab-a-b, and that the genus of AA is (a−1)(b−1)/2(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.