相关论文: On the computation of coefficients of modular form…
We propose an improved algorithm for computing mod $\ell$ Galois representations associated to a cusp form $f$ of level one. The proposed method allows us to explicitly compute the case with $\ell=29$ and $f$ of weight $k=16$, and the cases…
In this paper we explicitly compute mod-l Galois representations associated to modular forms. To be precise, we look at cases with l<=23 and the modular forms considered will be cusp forms of level 1 and weight up to 22. We present the…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
This note proposes an improved estimate of the coefficient t(n) of the discriminant modular form using elementary method. It improves a well known estimate of the tau function t(n) by Deligne.
We describe the $p$-divisibility transposition for the Fourier coefficients of Siegel modular forms. This provides a supplement to the result by Wilton for $p$-divisibility satisfied by the Ramanujan $\tau$-function.
In this paper, we find the number of representations of the quadratic form $x_1^2+ x_1x_2 + x_2^2 + \ldots + x_{2k-1}^2 + x_{2k-1}x_{2k} + x_{2k}^2,$ for $k=7,9,11,12,14$ using the theory of modular forms. By comparing our formulas with the…
We consider the problem of efficiently computing isolated coefficients $c_n$ in the Fourier series of the elliptic modular function $j(\tau)$. We show that a hybrid numerical-modular method with complexity $n^{1+o(1)}$ is efficient in…
We use properties of modular forms to prove the following extension of the Ramanujan-Mordell formula, \begin{align*} z^{k-j}z_p^{j}=&\frac{p_{\chi}^{k-j}-1}{p_{\chi}^{k}-1}F_p(k,j;\tau)+…
We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…
The modular forms are revisited from a geometric and an algebraic point of view leading to a geometric interpretation of the weak Maass forms connecting them to the Ramanujan Mock Theta functions and to the cusp forms generated from the…
In this article we use theoretical and numerical methods to evaluate in a closed-exact form the parameters of Ramanujan type $1/\pi$ formulas.
In this work, Ramanujan type congruences modulo powers of primes $p \ge 5$ are derived for a general class of products that are modular forms of level $p$. These products are constructed in terms of Klein forms and subsume generating…
An algorithm to obtain equations between theta functions with integral characteristics evaluated at $\tau$ and $p\tau$ for $g>1$ is presented.
We present an infinite family of identities that represent Ramanujan's tau function in terms of convolution sums of twisted divisor functions. Our method involves explicitly constructing non-vanishing level $1$ cusp forms from modular forms…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…
We compute modular Galois representations associated with a newform $f$, and study the related problem of computing the coefficients of $f$ modulo a small prime $\ell$. To this end, we design a practical variant of the complex…
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…
We give an asymptotic formula for the number of non-zero coefficients of modular forms (mod p).