Abstract
We present an algorithm which converts a given Sagbi basis of a polynomial K-subalgebra A with respect to one monomial ordering to the Sagbi basis of A with respect to another monomial ordering, under the assumption that the subalgebra A 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
