All Questions

Given $d,B>0$ the number of polynomials in $\mathbb Z[x]$ of degree $d$ and coefficient size at most $B$ have at least one integer roots should be $B^{O(d)}f(d)$ at some function $f$ (from Random ...

Take a bivariate polynomial of degree $d_x+d_y>\max(d_x,d_y)>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree). What is the ...

http://www.numbertheory.org/pdfs/general_quadratic_solution.pdf gives a general method to solve quadratic bivariate diophantine equation while Coppersmith introduced a method to solve bivariate ...

Take a bivariate polynomial of total degree $d$ satisfying $d=d_x=d_y>1$ in $\mathbb Z[x,y]$ with coefficients bound in absolute value by $b$ ($d_x$ is $x$-degree and $d_y$ is $y$-degree). Given a ...