首页> 外文期刊>Journal of symbolic computation >Maximally positive polynomial systems supported on circuits
【24h】

Maximally positive polynomial systems supported on circuits

机译:电路上支持的最大正多项式系统

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

A real polynomial system with support W subset of Z(n) is called maximally positive if all its complex solutions are positive solutions. A support W having n + 2 elements is called a circuit. We previously showed that the number of non-degenerate positive solutions of a system supported on a circuit W subset of Z(n) is at most m(W) + 1, where m(W) <= n is the degeneracy index of W. We prove that if a circuit W subset of Z(n) supports a maximally positive system with the maximal number m(W) + 1 of non-degenerate positive solutions, then it is unique up to the obvious action of the group of invertible integer affine transformations of Z(n). In the general case, we prove that any maximally positive system supported on a circuit can be obtained from another one having the maximal number of positive solutions by means of some elementary transformations. As a consequence, we get for each n and up to the above action a finite list of circuits W subset of Z(n) which can support maximally positive polynomial systems. We observe that the coefficients of the primitive affine relation of such circuit have absolute value 1 or 2 and make a conjecture in the general case for supports of maximally positive systems. (C) 2014 Published by Elsevier Ltd.
机译:如果Z(n)的支持W子集的实多项式系统的所有复数解都是正解,则称其为最大正。具有n + 2个元素的支撑W称为电路。我们先前证明,在Z(n)的电路W子集上支持的系统的非退化正解的数量最多为m(W)+ 1,其中m(W)<= n是W的退化指数。我们证明,如果Z(n)的电路W子集支持具有最大数目m(W)+ 1个非退化正解的最大正系统,那么它对可逆组的明显作用是唯一的Z(n)的整数仿射变换。在一般情况下,我们证明可以通过一些基本变换,从具有最大正解数的另一个系统中获得电路上支持的任何最大正系统。结果,对于每个n以及直到上述动作,我们得到Z(n)的电路W子集的有限列表,该列表可以支持最大正多项式系统。我们观察到这种电路的原始仿射关系的系数具有绝对值1或2,并且在一般情况下对最大正系统的支持进行了猜想。 (C)2014由Elsevier Ltd.出版

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号