Papers
Topics
Authors
Recent
Search
2000 character limit reached

A New Lower Bound in the $abc$ Conjecture

Published 26 Jan 2023 in math.NT and cs.DM | (2301.11056v2)

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\delta/e}$ where $\delta$ 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/\delta$.

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.

Authors (1)

Collections

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