TRANSITIVITY FOR WEAK AND STRONG GROBNER BASES

被引:3
作者
ADAMS, WW
BOYLE, A
LOUSTAUNAU, P
机构
[1] GEORGE MASON UNIV,FAIRFAX,VA 22030
[2] NATL SCI FDN,WASHINGTON,DC 20550
关键词
D O I
10.1006/jsco.1993.1003
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let R be a Noetherian integral domain which is graded by an ordered group Γ and let X be a set of n variables with a term order. It is shown that a finite subset F of R[X] is a weak (respectively strong) Gröbner basis in R[X] graded by Γ × Zn if and only if F is a weak Gröbner basis in R[X] graded by {0} × Zn and certain subsets of the set of leading coefficients of the elements of F form weak (respectively strong) Gröbner bases in R: It is further shown that any Γ-graded ring R for which every ideal has a strong Gröbner basis is isomorphic to k [x1,⋯, xn], where k is a PID. © 1993 Academic Press. All rights reserved.
引用
收藏
页码:49 / 65
页数:17
相关论文
共 11 条
[1]   SOME RESULTS ON GROBNER BASES OVER COMMUTATIVE RINGS [J].
ADAMS, WW ;
BOYLE, AK .
JOURNAL OF SYMBOLIC COMPUTATION, 1992, 13 (05) :473-484
[2]   A THEOREM ON REFINING DIVISION ORDERS BY THE REVERSE LEXICOGRAPHIC ORDER [J].
BAYER, D ;
STILLMAN, M .
DUKE MATHEMATICAL JOURNAL, 1987, 55 (02) :321-328
[3]  
Buchberger B., 1985, MULTIDIMENSIONAL SYS, P184
[4]  
GIANNI P, 1988, J SYMB COMPUT, V6, P148
[5]  
MIOLA A, 1988, J SYMB COMPUT, V6, P306
[6]   ON THE CONSTRUCTION OF GROBNER BASES USING SYZYGIES [J].
MOLLER, HM .
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (2-3) :345-359
[7]   ON THE THEORY OF GRADED STRUCTURES [J].
ROBBIANO, L .
JOURNAL OF SYMBOLIC COMPUTATION, 1986, 2 (02) :139-170
[8]  
ROBBIANO L, 1989, GROBNER BASES F COMM
[9]   LIFTING CANONICAL ALGORITHMS FROM A RING R TO THE RING R[X] [J].
SHTOKHAMER, R .
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (2-3) :169-181
[10]  
Zacharias G., 1978, THESIS MIT