Sharp precision in Hensel lifting for bivariate polynomial factorization

Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.

     

二元整系数多项式因式分解的一种理论和算法

我们发现可以把二元多项式盾成系数为一元多项式的一元多项式来进行分解，据此，本文建立了二元整系数多项式因式分解的一种理论，提出了一个完整的分解二元整系数多项式的算法。这个算法还能很自然地推广成分解多元整系数多项式的算法。     

The numerical condition of univariate and bivariate degree elevated Bernstein polynomials

The numerical condition of the degree elevation operation on Bernstein polynomials is considered and it is shown that it does not change the condition of the polynomial. In particular, several condition numbers for univariate and bivariate Bernstein polynomials, and their degree elevated forms, are developed and it is shown that the condition numbers of the degree elevated polynomials are identically equal to their forms prior to degree elevation. Computational experiments that verify this theoretical result are presented. The results in this paper differ from those in [Comput. Aided Geom. Design 4 (1987) 191–216] and [Comput. Aided Geom. Design 5 (1988) 215–252], where it is claimed that degree elevation causes a reduction in the numerical condition of a Bernstein polynomial. It is shown, however, that there is an error in the derivation of this result.     

Global optimization of rational functions: a semidefinite programming approach

We consider the problem of global minimization of rational functions on (unconstrained case), and on an open, connected, semi-algebraic subset of , or the (partial) closure of such a set (constrained case). We show that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using reformulations introduced in the PhD thesis of Jibetean [16]. This extends the analogous results by Nesterov [13] for global minimization of univariate polynomials. For the bivariate case (n = 2), we obtain a fully polynomial time approximation scheme (FPTAS) for the unconstrained problem, if an a priori lower bound on the infimum is known, by using results by De Klerk and Pasechnik [1]. For the NP-hard multivariate case, we discuss semidefinite programming-based relaxations for obtaining lower bounds on the infimum, by using results by Parrilo [15], and Lasserre [12].     

On a tropical dual Nullstellensatz

Since a tropical Nullstellensatz fails even for tropical univariate polynomials we study a conjecture on a tropical dual Nullstellensatz for tropical polynomial systems in terms of solvability of a tropical linear system with the Cayley matrix associated to the tropical polynomial system. The conjecture on a tropical effective dual Nullstellensatz is proved for tropical univariate polynomials.     

Factoring multivariate polynomials via partial differential equations

A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation that gives a system of linear equations. As in Berlekamp's and Niederreiter's algorithms for factoring univariate polynomials, the dimension of the solution space of the linear system is equal to the number of absolutely irreducible factors of the polynomial to be factored, and any basis for the solution space gives a complete factorization by computing gcd's and by factoring univariate polynomials over the ground field. The new method finds absolute and rational factorizations simultaneously and is easy to implement for finite fields, local fields, number fields, and the complex number field. The theory of the new method allows an effective Hilbert irreducibility theorem, thus an efficient reduction of polynomials from multivariate to bivariate.

     

Irreducibility of polynomials modulo p via Newton polytopes

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.     

A Gröbner Free Alternative for Polynomial System Solving

Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic extension defined by the set of roots, its minimal polynomial, and the parametrizations of the coordinates. Such a representation of the solutions has a long history which goes back to Leopold Kronecker and has been revisited many times in computer algebra. We introduce a new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials. We give a new codification of the set of solutions of a positive dimensional algebraic variety relying on a new global version of Newton's iterator. Roughly speaking the complexity of our algorithm is polynomial in some kind of degree of the system, in its height, and linear in the complexity of evaluation of the system. We present our implementation in the Magma system which is called Kronecker in homage to his method for solving systems of polynomial equations. We show that the theoretical complexity of our algorithm is well reflected in practice and we exhibit some cases for which our program is more efficient than the other available software.     

A sharp bound for the degree of proper monomial mappings between balls

The authors prove that a proper monomial holomorphic mapping from the two-ball to the N-ball has degree at most 2N-3, and that this result is sharp. The authors first show that certain group-invariant polynomials (related to Lucas polynomials) achieve the bound. To establish the bound the authors introduce a graph-theoretic approach that requires determining the number of sinks in a directed graph associated with the quotient polynomial. The proof also relies on a result of the first author that expresses all proper polynomial holomorphic mappings between balls in terms of tensor products.     

Fast computation of generic bivariate resultants

We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using a randomized algorithm of Las Vegas type. A similar complexity bound is proved for the computation of the lexicographical Gröbner basis for the ideal generated by the two polynomials.     

Exponential sums and singular hypersurfaces

We give upper bounds for the absolute value of exponential sums in several variables attached to certain polynomials with coefficients in a finite field. This bounds are given in terms of invariants of the singularities of the projective hypersurface defined by its highest degree form. For exponential sums attached to the reduction modulo a power of a large prime of a polynomial f with integer coefficients and veryfying a certain condition on the singularities of its highest degree form, we give a bound in terms of the dimension of the Jacobian quotient . Received: 3 November 1997     

Trivariate near-best blending spline quasi-interpolation operators

A method to define trivariate spline quasi-interpolation operators (QIOs) is developed by blending univariate and bivariate operators whose linear functionals allow oversampling. In this paper, we construct new operators based on univariate B-splines and bivariate box splines, exact on appropriate spaces of polynomials and having small infinity norms. An upper bound of the infinity norm for a general blending trivariate spline QIO is derived from the Bernstein-Bézier coefficients of the fundamental functions associated with the operators involved in the construction. The minimization of the resulting upper bound is then proposed and the existence of a solution is proved. The quadratic and quartic cases are completely worked out and their exact solutions are explicitly calculated.     

Asymptotic Conditions for Degree Diminution Along Prescribed Lines

One of the problems in bivariate polynomial interpolation is the choice of a space of polynomials suitable for interpolating a given set of data. Depending on the number of data, a usual space is that of polynomials in 2 variables of total degree not greater than k. However, these spaces are not enough to cover many interpolation problems. Here, we are interested in spaces of polynomials of total degree not greater than k whose degree diminishes along some prescribed directions. These spaces arise naturally in some interpolation problems and we describe them in terms of polynomials satisfying some asymptotic interpolation conditions. This provides a general frame to the interpolation problems studied in some of our recent papers.     

Newton-Thiele's rational interpolants

It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.     

Erratum to “The primes contain arbitrarily long polynomial progressions”

In our previous paper “The primes contain arbitrarily long polynomial progressions” [Acta Math., 201 (2008), 213–305] there were some minor errors in our definition of the polynomial forms and polynomial correlation conditions, which is unreasonably strong as written due to the overly loose bound on the degree of the polynomials involved. In this erratum we repair this issue by capping the degree of the polynomials more strongly, and adjusting some other relevant components of the argument accordingly.     

A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

For the last almost three decades, since the famous Buchberger-Möller (BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of bivariate polynomial interpolation on cartesian point sets that gives us a related degree reducing interpolation monomial and Newton bases directly. Since the bases are involved in the computation process as well as contained in the final output of the BM algorithm, our paradigm obviously simplifies the computation and accelerates the BM process. The experiments show that the paradigm is best suited for the computation over finite prime fields that have many applications.     

Bezout equations over bivariate polynomial matrices related by an entire function

This study addresses Bezout equations over bivariate polynomial matrices, where the relationship between two variables is described by a real entire function. This paper proposes a solution method that makes optimal use of minor primeness to reduce such Bezout equations to simple equations over univariate scalar polynomials. The proposed solution method requires only matrix calculations, thus making it very useful, especially in the absence of modern computer algebra systems.     

Diophantine m-tuples for linear polynomials II. Equal degrees

In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the property from above. This significantly improves a recent result of the first two authors with Tichy [A. Dujella, C. Fuchs, R.F. Tichy, Diophantine m-tuples for linear polynomials, Period. Math. Hungar. 45 (2002) 21-33].     

Stability of rootfinding for barycentric Lagrange interpolants

Computing the roots of a univariate polynomial can be reduced to computing the eigenvalues of an associated companion matrix. For the monomial basis, these computations have been shown to be numerically stable under certain conditions. However, for certain applications, polynomials are more naturally expressed in other bases, such as the Lagrange basis or orthogonal polynomial bases. For the Lagrange basis, the equivalent stability results have not been published. We show that computing the roots of a polynomial expressed in barycentric form via the eigenvalues of an associated companion matrix pair is numerically stable, and give a bound for the backward error. Numerical experiments show that the error bound is approximately an order of magnitude larger than the backward error. We also discuss the matter of scaling and balancing the companion matrix to bring it closer to a normal pair. With balancing, we are able to produce roots with small backward error.     

Generating approximate parametric roots of parametric polynomials

Built upon a ground field is the parametric field, the Puiseux field, of semi-terminating formal fractional power series. A parametric polynomial is a polynomial with coefficients in the parametric field, and roots of parametric polynomials are parametric. For a parametric polynomial with nonterminating parametric coefficients and a target accuracy, using sensitivity of the Newton Polygon process, a complete set of approximate parametric roots, each meeting target accuracy, is generated. All arguments are algebraic, from the inside out, self-contained, penetrating, and uniform in that only the Newton Polygon process is used, for both preprocessing and intraprocessing. A complexity analysis over ground field operations is developed; setting aside root generation for ground field polynomials, but bounding such, polynomial bounds are established in the degree of the parametric polynomial and the target accuracy.