We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
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 $.
We define certain arithmetic derivatives on
$\mathbb {Z}$
that respect the Leibniz rule, are additive for a chosen equation
$a+b=c$
, and satisfy a suitable nondegeneracy condition. Using Geometry of Numbers, we unconditionally show their existence with controlled size. We prove that any power-saving improvement on our size bounds would give a version of the
$abc$
Conjecture. In fact, we show that the existence of sufficiently small arithmetic derivatives in our sense is equivalent to the
$abc$
Conjecture. Our results give an explicit manifestation of an analogy suggested by Vojta in the eighties, relating Geometry of Numbers in arithmetic to derivatives in function fields and Nevanlinna theory. In addition, our construction formalizes the widespread intuition that the
$abc$
Conjecture should be related to arithmetic derivatives of some sort.
Suppose $a^{2}(a^{2}+1)$ divides $b^{2}(b^{2}+1)$ with $b>a$. We improve a previous result and prove a gap principle, without any additional assumptions, namely $b\gg a(\log a)^{1/8}/(\log \log a)^{12}$. We also obtain $b\gg _{\unicode[STIX]{x1D716}}a^{15/14-\unicode[STIX]{x1D716}}$ under the abc conjecture.
We develop a language that makes the analogy between geometry and arithmetic more transparent. In this language there exists a base field $\mathbb{F}$, ‘the field with one element’; there is a fully faithful functor from commutative rings to $\mathbb{F}$-rings; there is the notion of the $\mathbb{F}$-ring of integers of a real or complex prime of a number field $K$ analogous to the $p$-adic integers, and there is a compactification of $\operatorname{Spec}O_K$; there is a notion of tensor product of $\mathbb{F}$-rings giving the product of $\mathbb{F}$-schemes; in particular there is the arithmetical surface $\operatorname{Spec} O_K\times\operatorname{Spec} O_K$, the product taken over $\mathbb{F}$.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.