Term order for Groebner basis, revisited (Computer Algebra - Theory and its Applications)

HANDLE Web Site Open Access

Bibliographic Information

Other Title
  • グレブナー基底の項順序についての再考
  • グレブナー キテイ ノ コウ ジュンジョ ニ ツイテ ノ サイコウ

Search this article

Abstract

In this preliminary report, we introduce a method to find a term order such that the given set of polynomials F is a GrÖbner basis for the ideal I = <F>. We note that this problem can be solved by the method given by Strumfels and Wiegelmann that is based on the maximum matching problem for bipartite graphs and linear programming, but this time we consider a different approach.

Journal

  • RIMS Kokyuroku

    RIMS Kokyuroku 2185 22-28, 2021-04

    京都大学数理解析研究所

Details 詳細情報について

Report a problem

Back to top