当前位置: X-MOL 学术arXiv.cs.SC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal Descartes' Rule of Signs for Circuits
arXiv - CS - Symbolic Computation Pub Date : 2020-10-19 , DOI: arxiv-2010.09165
Fr\'ed\'eric Bihan, Alicia Dickenstein and Jens Forsg{\aa}rd

We present an optimal version of Descartes' rule of signs to bound the number of positive real roots of a sparse system of polynomial equations in n variables with n+2 monomials. This sharp upper bound is given in terms of the sign variation of a sequence associated to the exponents and the coefficients of the system.

中文翻译:

电路的最优笛卡尔符号规则

我们提出了笛卡尔符号规则的最佳版本,以限制具有 n+2 个单项式的 n 个变量中的多项式方程稀疏系统的正实根数。这个尖锐的上限是根据与系统的指数和系数相关联的序列的符号变化给出的。
更新日期:2020-10-20
down
wechat
bug