A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis

DOI10.1016/j.jsc.2023.102233zbMath1523.13043OpenAlexW4379879533MaRDI QIDQ6170821

Nguyen Thi Dung, Marcel Morales

Publication date: 10 August 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2023.102233

zbMATH Keywords

Gröbner basissemigroup ringspseudo-Frobenius numberFrobenius numberApéry set

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Cohen-Macaulay modules (13C14) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

Related Items

A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis, On the type and generators of monomial curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical semigroups. II: Pseudo-symmetric AA-semigroups.
• Noether resolutions in dimension 2
• Numerical semigroups: Apéry sets and Hilbert series.
• Minimal sets of generators for the relation ideals of certain monomial curves
• Equations of monomial varieties in codimension two
• Solving thousand-digit Frobenius problems using Gröbner bases
• On the linear diophantine problem of Frobenius.
• On a linear Diophantine problem of Frobenius.
• On a linear Diophantine problem of Frobenius. II.
• THE SHORT RESOLUTION OF A SEMIGROUP ALGEBRA
• On the type and generators of monomial curves
• A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis