書誌事項
- タイトル別名
-
- 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.
収録刊行物
-
- 数理解析研究所講究録
-
数理解析研究所講究録 2185 22-28, 2021-04
京都大学数理解析研究所
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050289321231537664
-
- NII論文ID
- 120007141776
- 40022681868
-
- NII書誌ID
- AN00061013
-
- HANDLE
- 2433/264914
-
- NDL書誌ID
- 031684518
-
- ISSN
- 18802818
-
- 本文言語コード
- ja
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB
- NDL
- CiNii Articles