Sparse multivariate factorization by mean of a few bivariate factorizations
Texte intégral
Documents relatifs
Building on [DZ07], Zannier proved in [Zan10] a toric version of Hilbert irreducibil- ity theorem and then deduce from it an analogue of Bertini’s theorem for covers, where the
The only difference with Lecerf’s algorithm is that we need to compute the truncated analytic factorization along a critical fiber, a difficulty that is compensated by an
Problem : Does not take into account the Newton polytope... of Complexity) One can factorize non degenerated bivariate polynomials over a number eld in time O( Vol ( N f ) ω )
The paper is organized as follows: we show in Section 2 that if the size of the dictionary is not bounded, then dictionary learning may be naturally cast as a convex
Structure of this paper. In Section 1, we recall some results about the Jacobian derivative and Darboux polynomials. In Section 2, we describe a reduction step which eases
A great advantage of our algorithm is that it replaces the usual univariate factor- ization in degree d = deg(f ) by the factorization of the exterior facet polynomials of f :
In (Duval, 1991), an algorithm is given for absolute bivariate factorization based on locally constant rational functions on the curve, using normalization and rational
Comparison with Weimann algorithm [33].— Our algorithm described in Sub- section 3.4 has been improved later by the author who obtained a deterministic al- gorithm that factors