AbstractGiven an irreducible polynomial P∈Z [ X ] of degree at least three and 0 ≠=a∈Z we are going to determine all those monic quadratic polynomials Q∈Z [ X ] satisfyingRes(P, Q) = a. This is the first attempt for the complete resolution of resultant type equations. We illustrate our algorithm with a detailed example
13 pages.International audienceThe multivariate resultant is a fundamental tool of computational alg...
Let K be an algebraic number field and let (Gn) be a linear recurring sequence defined by Gn = + P...
AbstractIn this paper, we are interested by the following generalization for the polynomial Goldbach...
AbstractGiven an irreducible polynomial P∈Z [ X ] of degree at least three and 0 ≠=a∈Z we are going ...
In this article, we study the residual resultant which is the necessary and sufficient condition for...
AbstractIn this article, we study the residual resultant which is the necessary and sufficient condi...
Let α be an algebraic number of degree d ≥ 3 and let K be the algebraic number field Q(α). When ε is...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
Let Fqt be the finite field with qt elements and let F*qt be its multiplicative group. We study the ...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
International audienceAn algorithm is presented for computing the resultant of two generic bivariate...
A resultant is a purely algebraic criterion for determining when a finite collection of polynomials...
AbstractThis paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for...
AbstractIn this paper, we study the number of representations of polynomials of the ringFq[T] by dia...
Let n∈N be fixed, Q>1 be a real parameter and Pn(Q) denote the set of polynomials over Z of degree n...
13 pages.International audienceThe multivariate resultant is a fundamental tool of computational alg...
Let K be an algebraic number field and let (Gn) be a linear recurring sequence defined by Gn = + P...
AbstractIn this paper, we are interested by the following generalization for the polynomial Goldbach...
AbstractGiven an irreducible polynomial P∈Z [ X ] of degree at least three and 0 ≠=a∈Z we are going ...
In this article, we study the residual resultant which is the necessary and sufficient condition for...
AbstractIn this article, we study the residual resultant which is the necessary and sufficient condi...
Let α be an algebraic number of degree d ≥ 3 and let K be the algebraic number field Q(α). When ε is...
AbstractThe paper considers bounds on the size of the resultant for univariate and bivariate polynom...
Let Fqt be the finite field with qt elements and let F*qt be its multiplicative group. We study the ...
AbstractLet α,β∈Fqt∗ and let Nt(α,β) denote the number of solutions (x,y)∈Fqt∗×Fqt∗ of the equation ...
International audienceAn algorithm is presented for computing the resultant of two generic bivariate...
A resultant is a purely algebraic criterion for determining when a finite collection of polynomials...
AbstractThis paper deals with some ideas of Bézout and his successors Poisson, Netto and Laurent for...
AbstractIn this paper, we study the number of representations of polynomials of the ringFq[T] by dia...
Let n∈N be fixed, Q>1 be a real parameter and Pn(Q) denote the set of polynomials over Z of degree n...
13 pages.International audienceThe multivariate resultant is a fundamental tool of computational alg...
Let K be an algebraic number field and let (Gn) be a linear recurring sequence defined by Gn = + P...
AbstractIn this paper, we are interested by the following generalization for the polynomial Goldbach...
DOI
Add to ORKG