Factorization of Polynomials Given by Arithmetic Branching Programs

Given a multivariate polynomial computed by an arithmetic branching program (ABP) of size s, we show that all its factors can be computed by arithmetic branching programs of size poly(s). Kaltofen gave a similar result for polynomials computed by arithmetic circuits. The previously known best upper bound for ABP-factors was poly $$ (s^{ {\rm \log} s}) $$ ( s log s ) .

Algorithms for Factorization of Polynomials of Low Degree

For polynomials of the third degree of a special type, expansions into linear factors are found. Various methods of factorization of fourth-degree polynomials of general and particular types are proposed. For polynomials of the sixth degree of a special kind, representations are given in the form of a product of polynomials of lower degrees. Special attention is paid to representations through square trinomials. The decomposition of the generalized reciprocal polynomial of the sixth degree into square trinomials is given.

Factorization of polynomials over valued fields based on graded polynomials

In this paper, we develop a new method based on Newton polygon and graded polynomials, similar to the known one based on Newton polygon and residual polynomials. This new method allows us the factorization of any monic polynomial in any henselian valued field. As applications, we give a new proof of Hensel’s lemma and a theorem on prime ideal factorization.

On Newton polygons techniques and factorization of polynomials over Henselian fields

Let [Formula: see text] be a valued field, where [Formula: see text] is a rank-one discrete valuation, with valuation ring [Formula: see text]. The goal of this paper is to investigate some basic concepts of Newton polygon techniques of a monic polynomial [Formula: see text]; namely, theorem of the product, of the polygon, and of the residual polynomial, in such way that improves that given in [D. Cohen, A. Movahhedi and A. Salinier, Factorization over local fields and the irreducibility of generalized difference polynomials, Mathematika 47 (2000) 173–196] and generalizes that given in [J. Guardia, J. Montes and E. Nart, Newton polygons of higher order in algebraic number theory, Trans. Amer. Math. Soc. 364(1) (2012) 361–416] to any rank-one valued field.