We study commutative algebra arising from generalised Frobenius numbers. The $k$-th (generalised) Frobenius number of relatively prime natural numbers $({a}_{1},\cdots ,{a}_{n})$ is the largest natural number that cannot be written as a non-negative integral combination of $({a}_{1},\cdots ,{a}_{n})$ in $k$ distinct ways. Suppose that $L$ is the lattice of integer points of ${({a}_{1},\cdots ,{a}_{n})}^{\perp}$. Taking our cue from the concept of lattice modules due to Bayer and Sturmfels, we define generalised lattice modules ${M}_{L}^{\left(k\right)}$ whose Castelnuovo–Mumford regularity captures the $k$-th Frobenius number of $({a}_{1},\cdots ,{a}_{n})$. We study the sequence ${\left\{{M}_{L}^{\left(k\right)}\right\}}_{k=1}^{\infty}$ of generalised lattice modules providing an explicit characterisation of their minimal generators. We show that there are only finitely many isomorphism classes of generalised lattice modules. As a consequence of our commutative algebraic approach, we show that the sequence of generalised Frobenius numbers forms a finite difference progression i.e. a sequence whose set of successive differences is finite. We also construct an algorithm to compute the $k$-th Frobenius number.

Accepted:

Published online:

DOI: 10.5802/alco.31

Keywords: Frobenius number, syzygy, lattice, poset, Castelnuovo–Mumford regularity

^{1}; Smith, Ben

^{2}

@article{ALCO_2019__2_1_149_0, author = {Manjunath, Madhusudan and Smith, Ben}, title = {Commutative algebra of generalised {Frobenius} numbers}, journal = {Algebraic Combinatorics}, pages = {149--171}, publisher = {MathOA foundation}, volume = {2}, number = {1}, year = {2019}, doi = {10.5802/alco.31}, mrnumber = {3912171}, zbl = {07024222}, language = {en}, url = {http://www.numdam.org/articles/10.5802/alco.31/} }

TY - JOUR AU - Manjunath, Madhusudan AU - Smith, Ben TI - Commutative algebra of generalised Frobenius numbers JO - Algebraic Combinatorics PY - 2019 SP - 149 EP - 171 VL - 2 IS - 1 PB - MathOA foundation UR - http://www.numdam.org/articles/10.5802/alco.31/ DO - 10.5802/alco.31 LA - en ID - ALCO_2019__2_1_149_0 ER -

Manjunath, Madhusudan; Smith, Ben. Commutative algebra of generalised Frobenius numbers. Algebraic Combinatorics, Volume 2 (2019) no. 1, pp. 149-171. doi : 10.5802/alco.31. http://www.numdam.org/articles/10.5802/alco.31/

[1] The Diophantine Frobenius problem, Oxford Lecture Series in Mathematics and its Applications, 30, Oxford University Press, 2005, xvi+243 pages | DOI | MR | Zbl

[2] Parametric polyhedra with at least $k$ lattice points: their semigroup structure and the $k$-Frobenius problem, Recent trends in combinatorics (The IMA Volumes in Mathematics and its Applications), Volume 159, Springer, 2016, pp. 753-778 | DOI | MR | Zbl

[3] Generalized Frobenius numbers: bounds and average behavior, Acta Arith., Volume 155 (2012) no. 1, pp. 53-62 | DOI | MR | Zbl

[4] Riemann-Roch for sub-lattices of the root lattice ${A}_{n}$, Electr. J. Comb., Volume 17 (2010) no. 1, R124, 50 pages | Zbl

[5] Computation of Hilbert functions, J. Symb. Comput., Volume 14 (1992) no. 1, pp. 31-50 | DOI | MR | Zbl

[6] Cellular resolutions of monomial modules, J. Reine Angew. Math., Volume 502 (1998), pp. 123-140 | DOI | MR | Zbl

[7] The Frobenius problem, rational polytopes, and Fourier-Dedekind sums, J. Number Theory, Volume 96 (2002) no. 1, pp. 1-21 | MR | Zbl

[8] A formula related to the Frobenius problem in two dimensions, Number theory (New York, 2003), Springer, 2004, pp. 17-23 | MR | Zbl

[9] Computing the continuous discretely. Integer-point enumeration in polyhedra, Undergraduate Texts in Mathematics, Springer, 2015, xx+285 pages | DOI | MR | Zbl

[10] A decomposition theorem for partially ordered sets, Ann. Math., Volume 51 (1950), pp. 161-166 | DOI | MR | Zbl

[11] The geometry of syzygies. A second course in commutative algebra and algebraic geometry, Graduate Texts in Mathematics, 229, Springer, 2005, xvi+243 pages | MR | Zbl

[12] Macaulay2, a software system for research in algebraic geometry, available at https://faculty.math.illinois.edu/Macaulay2/

[13] Lattice translates of a polytope and the Frobenius problem, Combinatorica, Volume 12 (1992) no. 2, pp. 161-177 | DOI | MR | Zbl

[14] Two-variable zeta-functions on graphs and Riemann-Roch theorems, Int. Math. Res. Not. (2012) no. 22, pp. 5100-5131 | DOI | MR | Zbl

[15] Combinatorial commutative algebra, Graduate Texts in Mathematics, 227, Springer, 2005, xiv+417 pages | MR | Zbl

[16] Generic lattice ideals, J. Am. Math. Soc., Volume 11 (1998) no. 2, pp. 363-373 | DOI | MR | Zbl

[17] The Frobenius number and $a$-invariant, Rocky Mt. J. Math., Volume 36 (2006) no. 6, pp. 2021-2026 | DOI | MR | Zbl

[18] The Frobenius problem and maximal lattice free bodies, Math. Oper. Res., Volume 18 (1993) no. 3, pp. 511-515 | DOI | MR | Zbl

[19] Gröbner bases and convex polytopes, University Lecture Series, 8, American Mathematical Society, 1996, xii+162 pages | MR | Zbl

*Cited by Sources: *