| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401188 | Journal of Symbolic Computation | 2014 | 16 Pages |
Abstract
We present an algorithm which converts a given Sagbi basis of a polynomial K -subalgebra AA with respect to one monomial ordering to the Sagbi basis of AA with respect to another monomial ordering, under the assumption that the subalgebra AA admits a finite Sagbi basis with respect to all monomial orderings. The Sagbi walk method converts a Sagbi basis by partitioning the computations following a path in the Sagbi fan.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Junaid Alam Khan,