グレブナー基底の項順序についての再考

HANDLE Web Site オープンアクセス

書誌事項

タイトル別名
  • Term order for Groebner basis, revisited (Computer Algebra - Theory and its Applications)
  • グレブナー キテイ ノ コウ ジュンジョ ニ ツイテ ノ サイコウ

この論文をさがす

抄録

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.

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ