HackerPapers

arXiv:2301.11056math.NT

A New Lower Bound in the $abc$ Conjecture

Curtis Bright

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby providing a new lower bound on the tightest possible form of the conjecture. This builds on work of van Frankenhuysen (1999) who proved the existence of examples satisfying the above bound with the constant $6.068$ in place of $6.563$. We show that the constant $6.563$ may be replaced by $4\sqrt{2δ/e}$ where $δ$ is a constant such that all full-rank unimodular lattices of sufficiently large dimension $n$ contain a nonzero vector with $\ell_1$ norm at most $n/δ$.

arXiv comments
Journal reference
Can. Math. Bull. 67 (2024) 369-378
DOI
doi:10.4153/S0008439523000784
Subjects
math.NTNumber Theory cs.DMDiscrete Mathematics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2023 to Jan 2023. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.