Related papers: Solving Polynomial Equations from Complex Numbers
We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].
The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…
The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
We study function-valued solutions of a class of stochastic partial differential equations, involving operators with polynomially bounded coefficients. We consider semilinear equations under suitable parabolicity hypotheses. We provide…
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…
We find a parametric solution of an arbitrary symmetric homogeneous diophantine equation of 5th degree in 6 variables using two primitive solutions. We then generalize this approach to symmetric forms of any odd degree by proving the…
Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…
We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…
The description of complex physical phenomena often involves sophisticated models that rely on a large number of parameters, with many dimensions and scales. One practical way to simplify that kind of models is to discard some of the…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…
We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…
Consider real or complex polynomial Riccati differential equations $a(x) \dot y=b_0(x)+b_1(x)y+b_2(x)y^2$ with all the involved functions being polynomials of degree at most $\eta$. We prove that the maximum number of polynomial solutions…
We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…
A nonlinear algebraic equation system of 5 variables is numerically solved, which is derived from the application of the Fourier transform to a differential equation system that allows modeling the behavior of the temperatures and the…