A weak XYZ conjecture for ABC solutions

At least 11 years old · documented by

Let X\frak X be the set of primitive nonzero integer solutions (A,B,C)(A,B,C) to A+B+C=0A+B+C=0, and let H(A,B,C)=max⁡{∣A∣,∣B∣,∣C∣}H(A,B,C)=\max\{|A|,|B|,|C|\} and S(A,B,C)=P+(ABC)S(A,B,C)=P^+(ABC).

Weak XYZ conjecture. For every δ>0\delta>0, there are only finitely many solutions (A,B,C)∈X(A,B,C)\in\frak X for which

log⁡H(A,B,C)>δS(A,B,C).\log H(A,B,C)>\delta S(A,B,C).

The source presents this as a weak version of part (a) of the XYZ conjecture and explicitly says that, at the time of writing, it was not known to follow from the ABC conjecture.

References

Primary source

James E. Weigandt, “Insulators of ABC Solutions”, arXiv:1401.6439 (2014).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.