On the Oesterlé-Masser conjecture

  title={On the Oesterl{\'e}-Masser conjecture},
  author={C. L. Stewart and Robert Tijdeman},
  journal={Monatshefte f{\"u}r Mathematik},
Letx, y andz be positive integers such thatx=y+z and ged (x,y,z)=1. We give upper and lower bounds forx in terms of the greatest squarefree divisor ofx y z. 
On the abc conjecture, II
Let x, y, and z be coprime positive integers with x + y = z. In this paper we give upper bounds for z in terms of the greatest square-free factor of xyz.
A + B = C and big III's
Assuming standard conjectures we show that there exist elliptic curves with Tate-Shafarevich group of order essentially as large as the square root of the conductor. We present some concrete examples
Diophantine Approximation and Nevanlinna Theory
Beginning with the work of Osgood [65], it has been known that the branch of complex analysis known as Nevanlinna theory (also called value distribution theory) has many similarities with Roth’s
The exceptional set in Vojta’s conjecture for algebraic points of bounded degree
We study the dependence on various parameters of the exceptional set in Vojta's conjecture. In particular, by making use of certain elliptic surfaces, we answer in the negative the often-raised
Relaxations of the ABC conjecture using integer k'th roots
Weakened forms of the ABC conjecture are defined in terms of the upper k’th root functions. These weakened forms, with quite small explicit values of their parameters, are shown to imply the
A Lower Bound in the abc Conjecture
Abstract We show that there exists an infinite sequence of sums P: a+b=c of rational integers with large height compared to the radical: h(P)⩾r(P)+4Kl  h ( P ) /log h(P) with Kl=2l/2  2 π / e >1.517
Two restricted ABC conjectures
A refinement of the abc conjecture
Based on recent work, by the first and third authors, on the distribution of the squarefree kernel of an integer, we present precise refinements of the famous abc conjecture. These rest on the sole
Counting solvable $S$-unit equations
We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.