首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Noether整环上的复合Groebner基
引用本文:陈小松,唐胜.Noether整环上的复合Groebner基[J].云南大学学报(自然科学版),2009,31(5):433.
作者姓名:陈小松  唐胜
作者单位:中南大学数学科学与计算技术学院, 湖南长沙 410083
摘    要: 对于Noether整环上n个变元的多项式环中的Groebner基以及m(m≥n)个变元的多项式环中的复合,通过引入S-多项式及合冲条件,证明了当复合与2个不同多项式环上的项序均相容并且是一组由首幂积为幂置换与置换外其余变元幂积的乘积组成的首1多项式时,Groebner基的计算与复合可交换.从而在此条件下,极小Groebner基的计算也与复合可交换.特别地,当m=n时,如果复合是与项序相容的一组首幂积为幂置换的首1多项式,Groebner基的计算与复合可交换.

关 键 词:Noether整环  复合Groebner基  合冲模  S-多项式  幂置换
收稿时间:2008-5-23

Composed Groebner basis over Noetherian domain
CHEN Xiao-song,TANG Sheng.Composed Groebner basis over Noetherian domain[J].Journal of Yunnan University(Natural Sciences),2009,31(5):433.
Authors:CHEN Xiao-song  TANG Sheng
Institution:School of Mathematical Sciences and Computational Technology, Central South University, Changsha 410083, China
Abstract:For Groebner basis in n variables and composition in m(m≥n) variables in a polynomial ring over Noetherian domain,it is proved that Groebner basis computation and composition is commutative if composition is compatible with two term orderings on the different polynomial rings and composition is a lists of monic polynomials with its leading powering products is the products of permuted powering and powering products of other remained variables by using S-polynomial and syzygy condition.Therefore,minimal Groebner basis computation is also commutative with composition under this condition.Especially,Groebner basis computation and composition is commutative if composition is compatible with term orderings and composition is a lists of monic polynomials with its leading powering product is a permuted powering when m=n.
Keywords:
点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《云南大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号