A. Furukawa

Learn More
Many computations relating polynomial ideals are reduced to <italic>calculating polynomial solutions of a system</italic> of linear equations with polynomial coefficients[1]. Zacharias[2] pointed out that Buchberger's algorithm[3] for Gr&#246;bner basis can be applied to solving such a linear equation. From the computational viewpoint, Zacharias' method(More)
In extending Buchberger's theory[1.2] of Gr&#246;bner basis of polynomial ideals, Gr&#246;bner basis (standard basis in the notion of Hironaka[3]) of ideals containing power series has been discussed by several authors: Galligo[4] discussed reduction procedure of power series w.r.t. a given Gr&#246;bner basis, and Mora[5] derived a construction procedure of(More)
  • 1