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

五次键合多项式P-不可约的两个定理
引用本文:解烈军. 五次键合多项式P-不可约的两个定理[J]. 纯粹数学与应用数学, 2008, 24(2)
作者姓名:解烈军
作者单位:宁波大学理学院数学系,浙江,宁波,315211
摘    要:在生物化学研究领域,对键合多项式P-不可约性的判定是一个重要问题.已有结果主要考虑四次或四次以下的多项式,而对五次或五次以上键合多项式的讨论尚未见报道.文章在这方面作了一定的探索,给出了五次键合多项式P-不可约的两组充分条件,这两组条件均是用多项式的系数构成的等式或不等式组显式表示的.

关 键 词:键合多项式  P-不可约  多项式判别系统  稳定判据

Two theorems for determining p-irreducibility of binding polynomials with degree five
XIE Lie-jun. Two theorems for determining p-irreducibility of binding polynomials with degree five[J]. Pure and Applied Mathematics, 2008, 24(2)
Authors:XIE Lie-jun
Affiliation:XIE Lie-jun (Department of Mathematics,Ningbo University,Ningbo 315211,China)
Abstract:The problem of deciding whether a binding polynomial has positive decompositions is important in studying many biochemistry processes.Many existing results about this were confined to the polynomials with degree less than five,and few were reported on the result concerning the binding polynomials with degree 5.We give two sets of sufficient conditions for judging the p-irreducibility,which expressed by some inequalities composed of the coefficients of the positive polynomial with degree five.
Keywords:binding polynomial  p-irreducibility  discrimination system for polynomials  stability criterion  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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