A new algorithm for computing SAGBI bases up to an arbitrary degree

نویسندگان

1 Department of Mathematics and Computer Sciences, Damghan University, Damghan, Iran

2 Department of Mathematics and Computer Sciences, Damghan University, Damghan, Iran

3 Department of Mathematics and Computer Sciences, Damghan University, Damghan, Iran

doi
10.22075/ijnaa.2017.1718.1640
چکیده

We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.