Signature based algorithm under non-compatible module term orderings (Computer Algebra : Foundations and Applications)

IR (HANDLE) Web Site Open Access

Bibliographic Information

Other Title
  • Non-compatibleな加群項順序の下でのsignature based algorithmについて
  • Non-compatible ナ カグンコウ ジュンジョ ノ シタ デ ノ signature based algorithm ニ ツイテ

Search this article

Description

The compatibility of a term ordering in a polynomial ring R = K[X] and a module term ordering in Rm is a sufficient condition of the termination of the signature based algorithm. Experiments show that a combination of non-compatible term orderings may give good performance for computing Groebner bases with respect to some term orderings. In such cases, we can apply the notion of Hilbert function for guaranteeing the termination. The hilbert function can be computed by using a Groebner basis with respect to another term ordering and thus this algorithm is a kind of change of ordering. We implement this algorithm in Risa/Asir and we compare its performance with the usual Hilbert driven algorithm.

Journal

  • RIMS Kokyuroku

    RIMS Kokyuroku 2224 1-9, 2022-06

    京都大学数理解析研究所

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top