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 no-reply@cambridge.org
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.
Let $\unicode[STIX]{x1D70F}(\cdot )$ be the classical Ramanujan $\unicode[STIX]{x1D70F}$-function and let $k$ be a positive integer such that $\unicode[STIX]{x1D70F}(n)\neq 0$ for $1\leqslant n\leqslant k/2$. (This is known to be true for $k<10^{23}$, and, conjecturally, for all $k$.) Further, let $\unicode[STIX]{x1D70E}$ be a permutation of the set $\{1,\ldots ,k\}$. We show that there exist infinitely many positive integers $m$ such that $|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(1))|<|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(2))|<\cdots <|\unicode[STIX]{x1D70F}(m+\unicode[STIX]{x1D70E}(k))|$. We also obtain a similar result for Hecke eigenvalues of primitive forms of square-free level.
We describe a method for complete solution of the superelliptic Diophantine equation ay$^p$=f(x). The method is based on Baker‘s theory of linear forms in the logarithms. The characteristic feature of our approach (as compared with the classical method) is that we reduce the equation directly to the linear forms in logarithms, without intermediate use of Thue and linear unit equations. We show that the reduction method of Baker and Davenport [3] is applicable for superelliptic equations, and develop a very efficient method for enumerating the solutions below the reduced bound. The method requires computing the algebraic data in number fields of degree pn(n-1)/2 at most; in many cases this number can be reduced. Two examples with p=3 and n=4 are given.
It is known that Siegel's theorem on integral points is effective for Galois coverings of the projective line. In this paper we obtain a quantitative version of this result, giving an explicit upper bound for the heights of S-integral K-rational points in terms of the number field K, the set of places S and the defining equation of the curve. Our main tools are Baker's theory of linear forms in logarithms and the quantitative Eisenstein theorem due to Schmidt, Dwork and van der Poorten.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.