Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
Niels Lauritzen
Abstract
We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.
Create a lesson
Related papers
On the Stable category of maximal Cohen-Macaulay modules over Gorenstein rings-II
Tony J. Puthenpurakal
Symbolic powers of the ideal ofn general points in Pn-1
Ralf Fröberg, Boris Shapiro
Density functions for filtrations of graded ideals
Suprajo Das, Hoang Le Truong
Finitistic injective dimension exceeding finitistic projective dimension for a commutative ring
Liang Chen
A criterion for determinantal presentations of numerical semigroup rings
Satoshi Murai, Kou Takahashi
Normality of ideals beyond the standard graded setting: families from numerical semigroup rings
Naoyuki Matsuoka