Abstract
We extend SAGBI basis theory to quotient rings and explain how the quotient ring SAGBI algorithm can be used to compute invariants. By an investigation of monomial subalgebras in quotients by binomial ideals, the algorithm is shown to terminate for computing invariants of the action of a torus or a finite abelian group.
Sign-in/Register to access full text options 
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.
