Janet Bases of Toric Ideals
Vladimir P. Gerdt, Yuri A. Blinkov
TL;DR
This paper introduces a specialized algorithm for computing Janet bases of toric ideals, utilizing Janet trees for efficient divisor search, and discusses its efficiency for practical applications.
Contribution
It presents a tailored polynomial involutive algorithm for toric ideals and introduces Janet trees to enhance computational speed.
Findings
Janet trees enable fast divisor searches.
The specialized algorithm improves efficiency in computing toric ideals.
Discussion on practical efficiency issues for the algorithm.
Abstract
In this paper we present a version of the general polynomial involutive algorithm for computing Janet bases specialized to toric ideals. The relevant data structures are Janet trees which provide a very fast search for a Janet divisor. We broach also efficiency issues in view of application of the algorithm presented to computation of toric ideals.
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
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Rings, Modules, and Algebras