AbstractA difference polynomial is one of the form P(x, y) = p(x) − q(y). Another proof is given of the fact that every difference polynomial has a connected zero set, and this theorem is applied to give an irreducibility criterion for difference polynomials. Some earlier problems about hereditarily irreducible polynomials (HIPs) are solved. For example, P(x, y) is called a HIP (two-variable case) if P(a(x), b(y)) is always irreducible, and it is shown that such two-variable HIPs actually exist
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial i...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...
AbstractA difference polynomial is one of the form P(x, y) = p(x) − q(y). Another proof is given of ...
A well-known result of Ehrenfeucht states that a difference polynomial f(X)-g(Y) in two variables X,...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
In this note, we show that, for any f ∈ Z[x] and any prime number p, there exists g ∈ Z[x] for which...
In this note, we show that, for any f∈ℤx and any prime number p, there exists g∈ℤx for which the pol...
AbstractFor polynomials of the form Q = P(f(X), g(Y), where P is a generalized difference polynomial...
Contrary to linear difference equations, there is no general theory of difference equations of the f...
Let A be a subset of the polynomials of degree less than N over a finite field Fq. Let r be any non-...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial i...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...
AbstractA difference polynomial is one of the form P(x, y) = p(x) − q(y). Another proof is given of ...
A well-known result of Ehrenfeucht states that a difference polynomial f(X)-g(Y) in two variables X,...
One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irredu...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
Some generalizations of the classical Eisenstein and Schönemann Irreducibility Criteria and their ap...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
In this note, we show that, for any f ∈ Z[x] and any prime number p, there exists g ∈ Z[x] for which...
In this note, we show that, for any f∈ℤx and any prime number p, there exists g∈ℤx for which the pol...
AbstractFor polynomials of the form Q = P(f(X), g(Y), where P is a generalized difference polynomial...
Contrary to linear difference equations, there is no general theory of difference equations of the f...
Let A be a subset of the polynomials of degree less than N over a finite field Fq. Let r be any non-...
AbstractWe characterize the polynomials P(X, Y) that are irreducible over a number field K and such ...
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial i...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...
In this paper, all irreducible factors of bivariate polynomials of the form f(x) - g(y) over an arbi...