Commutative Algebra of Generalised Frobenius Numbers

Abstract

We study commutative algebra arising from generalised Frobenius numbers. The k-th (generalised) Frobenius number of natural numbers (a1,…,an) is the largest natural number that cannot be written as a non-negative integral combination of (a1,…,an) in k distinct ways. Suppose that L is the lattice of integers points of (a1,…,an). Taking cue from the concept of lattice modules due to Bayer and Sturmfels, we define generalised lattice modules ML(k) whose Castelnuovo-Mumford regularity captures the k-th Frobenius number of (a1,…,an). We study the sequence \ML(k)\k=1∞ of generalised lattice modules providing an explicit characterisation of their minimal generators. We show that there are only finitely many isomorphism classes of generalized lattice modules. As a consequence of our commutative algebraic approach, we show that the sequence of generalised Frobenius numbers forms a generalised arithmetic progression. We also construct an algorithm to compute the k-th Frobenius number.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…