Paper detail

Commutative algebra and the linear diophantine problem of Frobenius

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.

preprint2016arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.