Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
Niels Lauritzen
TL;DR
This paper introduces a variant of the homogeneous Buchberger algorithm tailored for positively graded lattice ideals, successfully addressing Sullivant's computational commutative algebra challenge.
Contribution
The paper presents a new variant of the Buchberger algorithm that effectively solves a significant open problem in computational commutative algebra.
Findings
Successfully solved Sullivant's challenge
Developed a variant of the Buchberger algorithm for lattice ideals
Enhanced computational methods in algebra
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · graph theory and CDMA systems