In this lecture, we give precise necessary conditions for the vanishing of re-sultants. We have already found sufficient conditions: when the polynomials have common roots. First, we review some results on polynomials with common factors: Proposition 13.1 Consider polynomials of degree m and n: f = amx m +...+ a0, g = bnx n +...+ b0 with nonzero leading coefficients am and bn. The following are equivalent: 1. f and g have a common nonconstant factor; 2. there exist nonzero polynomials A and B wth deg(A) ≤ n − 1 and deg(B) ≤ m − 1, so that Af +Bg = 0. proof Assume that f and g have a common factor h, so we may write f = Bh g = −Ah for suitable polynomials A,B with deg(B) < deg(f) = m and deg(A) < deg(g) = n. Substituting gives the ...
In this note we present a proof of the following theorem. Theorem 0.1. Let k[t] be the ring of polyn...
Let R = K[x; σ] be a skew polynomial ring over a division ring K. Necessary and sufficient condition...
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonco...
AbstractWe consider certain generalisation of the resultant of two polynomials in one variable. Usin...
Let f1, . . . , fr be polynomials in n variables, over the field Fq, and suppose that their degrees ...
For f(x) ∈ C[x] with f(x) 6 ≡ 0, we define f̃(x) = xdeg ff(1/x). The polynomial f ̃ is called the ...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
The polynomial functions f, f,…, f are found to have highest common factor h for a set of values of ...
In 1997, Andrew Beal [1] announced the following conjecture: Let A,B,C,m, n, and l be positive integ...
AbstractLet f(x) and g(x) be two real polynomials whose leading coefficients have the same sign. Sup...
AbstractA difference polynomial is one of the form P(x, y) = p(x) − q(y). Another proof is given of ...
AbstractThe polynomial functions f1, f2,…, fm are found to have highest common factor h for a set of...
AbstractLet P and Q be polynomials and let α be an entire function. Suppose that Q and α are noncons...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
LetF(F1,...,Fn)∈(C[X1,...,X n])nwith det(J(F))∈C* and letMi(Xi,Y)=mi0(Y)+mi1(Y)X i+···+midi(Y)X i d ...
In this note we present a proof of the following theorem. Theorem 0.1. Let k[t] be the ring of polyn...
Let R = K[x; σ] be a skew polynomial ring over a division ring K. Necessary and sufficient condition...
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonco...
AbstractWe consider certain generalisation of the resultant of two polynomials in one variable. Usin...
Let f1, . . . , fr be polynomials in n variables, over the field Fq, and suppose that their degrees ...
For f(x) ∈ C[x] with f(x) 6 ≡ 0, we define f̃(x) = xdeg ff(1/x). The polynomial f ̃ is called the ...
: Given a polynomial f 2 k[x], k a number field, we consider bounds on the number of cyclotomic fact...
The polynomial functions f, f,…, f are found to have highest common factor h for a set of values of ...
In 1997, Andrew Beal [1] announced the following conjecture: Let A,B,C,m, n, and l be positive integ...
AbstractLet f(x) and g(x) be two real polynomials whose leading coefficients have the same sign. Sup...
AbstractA difference polynomial is one of the form P(x, y) = p(x) − q(y). Another proof is given of ...
AbstractThe polynomial functions f1, f2,…, fm are found to have highest common factor h for a set of...
AbstractLet P and Q be polynomials and let α be an entire function. Suppose that Q and α are noncons...
Let f(x) be a polynomial with integer coefficients. If either f(x) = xdegff(1/x) or f(x) = -xdegff(1...
LetF(F1,...,Fn)∈(C[X1,...,X n])nwith det(J(F))∈C* and letMi(Xi,Y)=mi0(Y)+mi1(Y)X i+···+midi(Y)X i d ...
In this note we present a proof of the following theorem. Theorem 0.1. Let k[t] be the ring of polyn...
Let R = K[x; σ] be a skew polynomial ring over a division ring K. Necessary and sufficient condition...
Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonco...