【24h】

On Approximate Irreducibility of Polynomials in Several Variables

机译:关于多个变量的多项式的近似不可约性

获取原文
获取原文并翻译 | 示例

摘要

We study the problem of bounding a polynomial away from polynomials which are absolutely irreducible. Such separation bounds are useful for testing whether a numerical polynomial is absolutely irreducible, given a certain tolerance on its coefficients. Using an absolute irreducibility criterion due to Ruppert, we are able to find useful separation bounds, in several norms, for bivariate polynomials. We also use Rup-pert's criterion to derive new, more effective Noether forms for polynomials of arbitrarily many variables. These forms lead to small separation bounds for polynomials of arbitrarily many variables.
机译:我们研究了将多项式与绝对不可约的多项式定界的问题。在给定其系数一定的容忍度的情况下,这种分离界限可用于测试数值多项式是否绝对不可约。使用基于Ruppert的绝对不可约性准则,我们能够在几个范数中找到双变量多项式的有用分离界限。我们还使用Rup-pert准则为任意多个变量的多项式推导新的,更有效的Noether形式。这些形式导致任意多个变量的多项式的较小分隔界。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号