缺项多元多项式的有界度因子
Bounded-degree factors of lacunary multivariate polynomials
摘要:
本文提出了一种计算缺元多元多项式有界度因子的新方法。特别是对于数域上的多项式,我们给出了一个新的算法,该算法以缺元表示的多元多项式f和一个次数界d作为输入,计算f在时间多项式中的次数不超过d的不可约因子,其中f在缺元表示中的次数界为d,f在时间多项式中的次数界为d.我们的算法,这是有效的任何领域的零特征,是基于一个新的间隙定理,使减少问题的几个实例(a)单变量的情况下,(b)低程度的多元因式分解。我们提出的约简算法是基本的,因为它们只操纵输入多项式的指数向量。正确性的证明和复杂性界依赖于多项式的牛顿多胞形,其中底层值域由单变量的Puixix级数组成。
英文摘要:
In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in lacunary representation and a degree bound d and computes the irreducible factors of degree at most d of f in time polynomial in the lacunary size of f and in d. Our algorithm, which is valid for any field of zero characteristic, is based on a new gap theorem that enables reducing the problem to several instances of (a) the univariate case and (b) low-degree multivariate factorization. The reduction algorithms we propose are elementary in that they only manipulate the exponent vectors of the input polynomial. The proof of correctness and the complexity bounds rely on the Newton polytope of the polynomial, where the underlying valued field consists of Puiseux series in a single variable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。