当前位置:
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.)
The D-plus Discriminant and Complexity of Root Clustering
arXiv - CS - Symbolic Computation Pub Date : 2021-05-09 , DOI: arxiv-2105.03856 Jing Yang, Chee K. Yap
arXiv - CS - Symbolic Computation Pub Date : 2021-05-09 , DOI: arxiv-2105.03856 Jing Yang, Chee K. Yap
Let $p(x)$ be an integer polynomial with $m\ge 2$ distinct roots
$\alpha_1,\ldots,\alpha_m$ whose multiplicities are
$\boldsymbol{\mu}=(\mu_1,\ldots,\mu_m)$. We define the D-plus discriminant of
$p(x)$ to be $D^+(p):= \prod_{1\le i
中文翻译:
根聚类的D加判别和复杂性
假设$ p(x)$是一个整数多项式,具有$ m \ ge 2 $个不同的根$ \ alpha_1,\ ldots,\ alpha_m $,其多重性为$ \ boldsymbol {\ mu} =(\ mu_1,\ ldots,\ mu_m )$。我们将$ p(x)$的D加判别式定义为$ D ^ +(p):= \ prod_ {1 \ le i
更新日期:2021-05-11
中文翻译:
根聚类的D加判别和复杂性
假设$ p(x)$是一个整数多项式,具有$ m \ ge 2 $个不同的根$ \ alpha_1,\ ldots,\ alpha_m $,其多重性为$ \ boldsymbol {\ mu} =(\ mu_1,\ ldots,\ mu_m )$。我们将$ p(x)$的D加判别式定义为$ D ^ +(p):= \ prod_ {1 \ le i