On Functions Satisfying Modular Equations for Infinitely Many Primes

For \(n\in\mathbb{N}\), \(n\geq 2\), set \(B_n=\{(a,r,d) \mid ad=n,\;0 \leq r<d,\;\text{gcd} (a,r,d)=1\}\). A function \(f\) satisfies an \(n\)-th modular equation if there exists a polynomial \(F_n(x,y)\) such that \[ F_n\bigl( x,f(z) \bigr)= \prod_{(a,r,d) \in B_n}\left(x-f \left({az+r \over d}\right) \right). \] The term of the highest degree in \(x\) in \(F_n(x,y)\) is \(x^{|B_n|}\), where \(|B_n|=n\prod_{p\mid n} (1+{1\over p})\). If \(I\) is an infinite set of prime numbers and if \(f\) is a function which satisfies modular equations for all \(p\in I\) then \(f\) is analytic in the upper half-plane \({\mathcal H}\). Moreover, if an addition \(f(z_1)= f(z_2)\) for some \(z_1,z_2 \in {\mathcal H}\) then there exists an analytic bijection between neighbourhoods of \(z_1\) and \(z_2\) which preserves \(f\).

Recommendations

Cited in

(3)

This page was built for publication: On Functions Satisfying Modular Equations for Infinitely Many Primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933917)