He–Shiue–Venkat decomposition conjecture for three-variable linear Diophantine equations

Let a,b,c,na,b,c,n be positive integers with gcd(a,b,c)=1\gcd(a,b,c)=1. For i=1,2,3i=1,2,3, let Si^\hat{S_i} be the set of non-negative integer solutions (x,y,z)(x,y,z) of ax+by+cz=nax+by+cz=n satisfying, respectively, x=0x=0, y=0y=0, and z=0z=0.

He–Shiue–Venkat conjecture. For any solution (x^,y^,z^)(\hat{x},\hat{y},\hat{z}) of ax+by+cz=nax+by+cz=n, there exist siSi^s_i\in\hat{S_i} such that

(x^,y^,z^)=s1s2+s3.(\hat{x},\hat{y},\hat{z})=s_1-s_2+s_3.

The paper reports that He, Shiue and Venkat verified the conjecture for some basic examples, but uses its bounds to disprove it; hence the conjecture is refuted.

Progress summary

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

Sources & referencesView supporting material

Primary source

Damanvir Singh Binner, “Some Bounds for Number of Solutions to ax + by + cz = n and their Applications”, arXiv:2106.13796 (2021).

Solutions 0

No solutions have been posted yet.