Papers › A New Method in the Problem of Three Cubes
A New Method in the Problem of Three Cubes
Armen Avagyan, Gurgen Dallakyan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In the current paper we are seeking P1(y),P2(y),P3(y) with the highest possible degree polynomials with integer coefficients, and Q(y) via the lowest possible degree polynomial, such that P1(y)^3+P2(y)^3+P3(y)^3=Q(y). Actually, the solution of this problem has close relation with the problem of the sum of three cubes a^3+b^3+c^3=d, since deg Q(y)=0 case coincides with above mentioned problem. It has been considered estimation of possibility of minimization of deg Q(y). As a conclusion, for specific values of d we survey a new algorithm for finding integer solutions of a^3+b^3+c^3=d.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections