Add to ORKGIn this paper we give a survey of recent results obtained by the authors on discriminant and resultant equations. The discriminant of a binary form F = ∑
In this paper a practical algorithm is given to find all binary forms with rational coefficients of ...
It is well known how to find the formulae for the number of representations of positive integers by ...
We will give new upper bounds for the number of solutions to the inequalities of the shape |F(x, y)|...
The first comprehensive and up-to-date account of discriminant equations and their applications. For...
AbstractIt can be deduced from a result of Gauss that the principal class of discriminant d represen...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
There are 18 (and possibly 19) integers that are not of the form xy+yz+xz with positive integers x, ...
In the present paper we give explicit upper bounds for the number of equivalence classes of binary f...
AbstractDiscriminantal divisors are defined, and the question is asked: Which discriminantal divisor...
This all must go back to people such as Legendre, Dirichlet, and Gauss. I have no idea, really. We u...
1. Introduction. In our paper [5] a sharp upper bound was given for the degree of an arbitrary squar...
Consider a representative system of the positive, integral binary quadratic forms of a given negativ...
AbstractIn this paper we study congruence conditions on class numbers of binary quadratic discrimina...
Let ∆ denote the discriminant of the generic binary d-ic. We show that for d ≥ 3, the Jacobian ideal...
In this paper we describe the quadratic forms over any field k which admit a similarity with a given...
In this paper a practical algorithm is given to find all binary forms with rational coefficients of ...
It is well known how to find the formulae for the number of representations of positive integers by ...
We will give new upper bounds for the number of solutions to the inequalities of the shape |F(x, y)|...
The first comprehensive and up-to-date account of discriminant equations and their applications. For...
AbstractIt can be deduced from a result of Gauss that the principal class of discriminant d represen...
In Part I the diophantine equation [formula] was studied, where [formula] is a linear binary recurre...
There are 18 (and possibly 19) integers that are not of the form xy+yz+xz with positive integers x, ...
In the present paper we give explicit upper bounds for the number of equivalence classes of binary f...
AbstractDiscriminantal divisors are defined, and the question is asked: Which discriminantal divisor...
This all must go back to people such as Legendre, Dirichlet, and Gauss. I have no idea, really. We u...
1. Introduction. In our paper [5] a sharp upper bound was given for the degree of an arbitrary squar...
Consider a representative system of the positive, integral binary quadratic forms of a given negativ...
AbstractIn this paper we study congruence conditions on class numbers of binary quadratic discrimina...
Let ∆ denote the discriminant of the generic binary d-ic. We show that for d ≥ 3, the Jacobian ideal...
In this paper we describe the quadratic forms over any field k which admit a similarity with a given...
In this paper a practical algorithm is given to find all binary forms with rational coefficients of ...
It is well known how to find the formulae for the number of representations of positive integers by ...
We will give new upper bounds for the number of solutions to the inequalities of the shape |F(x, y)|...