2000 character limit reached
On the and the conjectures
Published 7 Jun 2024 in math.NT | (2406.05083v1)
Abstract: We revisit a subexponential bound for the conjecture due to the first author, and we establish a variation of it using linear forms in logarithms. As an application, we prove an unconditional subexponential bound towards the $4$-terms conjecture under a suitable hypothesis on the size of the variables.
Paper Prompts
Sign up for free to create and run prompts on this paper.