Commutative algebra and the linear diophantine problem of Frobenius
Melvyn B. Nathanson

TL;DR
This paper explores the Frobenius problem using commutative algebra, providing algebraic proofs for classical results on Frobenius numbers and genus for two-element sets.
Contribution
It introduces a novel algebraic approach to the Frobenius problem, connecting semigroup theory with graded rings and Hilbert's syzygy theorem.
Findings
Algebraic proof of Frobenius number for two elements
Connection between semigroup properties and graded rings
New insights into the structure of numerical semigroups
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Graph theory and applications
