A New Lower Bound in the abc Conjecture

01/26/2023
by   Curtis Bright, et al.
0

We prove that there exist infinitely many coprime numbers a, b, c with a+b=c and c>rad(abc)exp(6.563√(log c)/loglog 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) whom 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√(2δ/e) where δ is a constant such that all full-rank unimodular lattices of sufficiently large dimension n contain a nonzero vector with ℓ_1 norm at most n/δ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2020

On the Nisan-Ronen conjecture

The Nisan-Ronen conjecture states that no truthful mechanism for makespa...
research
03/26/2023

The Subspace Flatness Conjecture and Faster Integer Programming

In a seminal paper, Kannan and Lovász (1988) considered a quantity μ_KL(...
research
11/04/2021

The discrepancy of unsatisfiable matrices and a lower bound for the Komlós conjecture constant

We construct simple, explicit matrices with columns having unit ℓ^2 norm...
research
01/07/2020

Rainbow matchings in k-partite hypergraphs

In this paper, we prove a conjecture of Aharoni and Howard on the existe...
research
01/23/2021

Point-hyperplane incidence geometry and the log-rank conjecture

We study the log-rank conjecture from the perspective of incidence geome...
research
07/17/2020

Lower Bound on Derivatives of Costa's Differential Entropy

Several conjectures concern the lower bound for the differential entropy...
research
06/15/2023

Improving the Lower Bound for the Union-closed Sets Conjecture via Conditionally IID Coupling

Recently, Gilmer proved the first constant lower bound for the union-clo...

Please sign up or login with your details

Forgot password? Click here to reset