Commutative algebra and the linear diophantine problem of Frobenius
Number Theory
2020-04-17 v2
Abstract
Let be a finite set of relatively prime positive integers, and let be the set of all nonnegative integral linear combinations of elements of . The set is a semigroup that contains all sufficiently large integers. The largest integer not in is the Frobenius number of , and the number of positive integers not in is the genus of . Sharp and Sylvester proved in 1884 that the Frobenius number of the set is , and that the genus of is . Graded rings and a simple form of Hilbert's syzygy theorem are used to give a commutative algebra proof of this result.
Keywords
Cite
@article{arxiv.1611.07415,
title = {Commutative algebra and the linear diophantine problem of Frobenius},
author = {Melvyn B. Nathanson},
journal= {arXiv preprint arXiv:1611.07415},
year = {2020}
}
Comments
10 pages. Minor improvements and corrected typos