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 obtain a fully explicit quantitative version of the Eisenstein theorem on algebraic power series which is more suitable for certain applications than the existing version due to Dwork, Robba, Schmidt and van der Poorten. We also treat ramified series and Laurent series, and we demonstrate some applications; for instance, we estimate the discriminant of the number field generated by the coefficients.

It is a well known result of Y. André (a basic special case of the André-Oort conjecture) that an irreducible algebraic plane curve containing infinitely many points whose coordinates are CM-invariants is either a horizontal or vertical line, or a modular curve Y0(n). André's proof was partially ineffective, due to the use of (Siegel's) class-number estimates. Here we observe that his arguments may be modified to yield an effective proof. For example, with the diagonal line X1+X2=1 or the hyperbola X1X2=1 it may be shown quite quickly that there are no imaginary quadratic τ1,τ2 with j(τ1)+j(τ2)=1 or j(τ1)j(τ2)=1, where j is the classical modular function.

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.

A theorem of Macbeath asserts that μ(A+B)[ges ]min(1, μ(A)+μ(B)) for any subsets A and B of a finite-dimensional torus. We conjecture that, when the obvious exceptions are excluded, a stronger inequality

formula here

holds, and we prove this conjecture under some technical restrictions.

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.