期刊文献+

五次键合多项式P-不可约的两个定理

Two theorems for determining p-irreducibility of binding polynomials with degree five
下载PDF
导出
摘要 在生物化学研究领域,对键合多项式P-不可约性的判定是一个重要问题.已有结果主要考虑四次或四次以下的多项式,而对五次或五次以上键合多项式的讨论尚未见报道.文章在这方面作了一定的探索,给出了五次键合多项式P-不可约的两组充分条件,这两组条件均是用多项式的系数构成的等式或不等式组显式表示的. 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.
作者 解烈军
出处 《纯粹数学与应用数学》 CSCD 北大核心 2008年第2期314-320,共7页 Pure and Applied Mathematics
基金 国家自然科学基金(10571095)
关键词 键合多项式 P-不可约 多项式判别系统 稳定判据 binding polynomial7 p-irreducibility, discrimination system for polynomials, stability criterion
  • 相关文献

参考文献3

二级参考文献14

  • 1[1]Mishra B. Algorithmic Algebra. New York: Springer-verlag, 1993
  • 2[2]Yang L, Zhang J Z, Hou X R. Nonlinear Algebraic Equation Systems and Automated Theorem Proving.Shanghai: Shanghai Science, Technology and Education Publishing House, 1996 (in Chinese)
  • 3[3]Yang L, Hou X R, Zeng Z B. A Complete Discrimination System for Polynomials. Science in China(Series E), 39(6): 628-646
  • 4[4]Yang L, Hou X R, Xia B C. A Complete Algorithm for a Class of Inequality Type Theorems. Science in China (Seires F), 2001, 44:33-49
  • 5[5]Yang L, Xia B C. Explicit Criterion to Determine the Number of Positive Roots of a Polynomial.MM Research Preprints, 15, 134-145. Beijing: Mathematics Mechanization Research Center, 1997
  • 6[6]Yang L. Recent Advances on Determining the Number of Real Roots of Parametric Polynomials. J.Symb. Conput., 1999, 28:225-242
  • 7[7]Wyman J. The Binding Potential, A Neglected Linkage Concept. J. Mol. Biol., 1965, 11:631-644
  • 8[8]Briggs W E. Zeros and Factors of Polynomials with Positive Coefficients and Protein-ligand Binding.Rocky Mount. J. Math., 1985, 15(1): 75-89
  • 9[9]Bardsley W G. Factorability of the Allosteric Binding Polynomial and Graphical Manifestations of Cooperativity in Third Degree Saturation Functions. J. Theor. Biol., 1977, 67:407-431
  • 10[10]Bardsley W G. Woolfson R, Mazat J -P. Relationships Between the Magnitude of Hill Plot Slopes,Apparent Binding Constants and Factorability of Binding Polynomials and their Hessians. J. Theor.Biol., 1980, 85:247-284

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部