Papers
Topics
Authors
Recent
Search
2000 character limit reached

An effective estimate for the sum of two cubes problem

Published 11 Mar 2024 in math.NT | (2403.17955v3)

Abstract: Let $f(x, y) \in \mathbb{Z}[x, y]$ be a cubic form with non-zero discriminant, and for each integer $m \in \mathbb{Z}$, let, $N_{f}(m)=#\left{(x, y) \in \mathbb{Z}{2}: f(x, y)=m\right} $. In 1983, Silverman proved that $N_{f}(m)>\Omega\left((\log |m|){3 / 5}\right)$ when $f(x, y)=x{3}+y{3}$. In this paper, we obtain an explicit bound for $N_f(m)$, namely, showing that $N_{f}(m)>4.2\times 10{-6}(\log |m|){11/13}$ (holds for infinitely many integers m), when $f(x, y)=x{3}+y{3}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.