Related papers: Irreducible binary cubics and the generalized supe…

We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.

In this paper, it is shown that if F(x , y) is an irreducible binary form with integral coefficients and degree $n \geq 3$, then provided that the absolute value of the discriminant of F is large enough, the equation |F(x , y)| = 1 has at…

Let $F(x,y)$ be an irreducible binary form of degree $\geq 3$ with integer coefficients and with real roots. Let $M$ be an imaginary quadratic field, with ring of integers $Z_M$. Let $K>0$. We describe an efficient method how to reduce the…

A pair of symmetric bilinear forms A and B determine a binary form $f(x,y) = disc(Ax-By)$. We prove that the question of whether a given binary form can be written in this way as a discriminant form generically satisfies a local-global…

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

Let $h(x,y)$ be a non-degenerate binary cubic form with integral coefficients, and let $S$ be an arbitrary finite set of prime numbers. By a classical theorem of Mahler, there are only finitely many pairs of relatively prime integers $x,y$…

We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

We consider hyper- and superelliptic equations $f(x)=by^m$ with unknowns x,y from the ring of S-integers of a given number field K. Here, f is a polynomial with S-integral coefficients of degree n with non-zero discriminant and b is a…

In this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to…

We consider absolutely irreducible polynomials $f \in Z[x,y]$ with $\deg_x(f)=m$, $\deg_y(f)=n$ and height $H$. We show that for any prime $p$ with $p>c_{mn} H^{2mn+n-1}$ the reduction $f \bmod p$ is also absolutely irreducible. Furthermore…

For $F \in \mathbb{Z}[s,t]$ a binary quadratic form which is irreducible over $\mathbb{Q}$, and $L$ an abelian number field with class number $1$, we obtain the order of magnitude for the number of values $F(s,t)$ which are a norm from $L$.…

We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field $K$. More precisely, we give effective bounds for the number of specializations $t\in \mathcal{O}_K$ that do not preserve the irreducibility…

Erd\"os and Obl\'ath proved that the equation $n!\pm m!=x^p$ has only finitely many integer solutions. More general, under the ABC-conjecture, Luca showed that $P(x)=An!+Bm!$ has finitely many integer solutions for polynomials of degree…

Suppose that h in F[x,y,z], char F=2, defines a nodal cubic. In earlier papers we made a precise conjecture as to the Hilbert-Kunz functions attached to the powers of h. Assuming this conjecture we showed that a class of characteristic 2…

Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…