A new lower bound in the $abc$ conjecture
Canadian mathematical bulletin, Tome 67 (2024) no. 2, pp. 369-378
Voir la notice de l'article provenant de la source Cambridge
We prove that there exist infinitely many coprime numbers a, b, c with $a+b=c$ and $c>\operatorname {\mathrm {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. Our work builds on that of van Frankenhuysen (J. Number Theory 82(2000), 91–95) 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 unimodular lattices of sufficiently large dimension n contain a nonzero vector with $\ell _1$-norm at most $n/\delta $.
Mots-clés :
abc conjecture, good abc examples, abc conjecture lower bound
Bright, Curtis. A new lower bound in the $abc$ conjecture. Canadian mathematical bulletin, Tome 67 (2024) no. 2, pp. 369-378. doi: 10.4153/S0008439523000784
@article{10_4153_S0008439523000784,
author = {Bright, Curtis},
title = {A new lower bound in the $abc$ conjecture},
journal = {Canadian mathematical bulletin},
pages = {369--378},
year = {2024},
volume = {67},
number = {2},
doi = {10.4153/S0008439523000784},
url = {http://geodesic.mathdoc.fr/articles/10.4153/S0008439523000784/}
}
Cité par Sources :