Related papers: Computing isolated coefficients of the $j$-functio…

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method…

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.

The Euler quotient modulo an odd-prime power $p^r~(r>1)$ can be uniquely decomposed as a $p$-adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+a_{r-1}(u)p^{r-1} \pmod {p^r},~ \gcd(u,p)=1, $$ where $0\le…

Two classes of infinite series involving harmonic numbers and the binomial coefficient $C(3n,n)$ are evaluated in closed form using integrals. Several remarkable integral values and difficult series identities are stated as special cases of…

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…

In their work, Serre and Swinnerton-Dyer study the congruence properties of the Fourier coefficients of modular forms. We examine similar congruence properties, but for the coefficients of a modified Taylor expansion about a CM point…

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of a positive integer $N$ in $N^{2/9+o(1)}$ bit operations. Prior to this breakthrough, the best known complexity bound for this problem…

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

We develop an algorithm to test whether a non-CM elliptic curve $E/\mathbb{Q}$ gives rise to an isolated point of any degree on any modular curve of the form $X_1(N)$. This builds on prior work of Zywina which gives a method for computing…

We describe a complete algorithm to compute millions of coefficients of classical modular forms in a few seconds. We also review operations on Euler products and illustrate our methods with a computation of triple product L-function of…

Let $\ell\ge5$ be an odd prime and $j, s$ be positive integers. We study the distribution of the coefficients of integer and half-integral weight modular forms modulo odd positive integer $M$. As a consequence, we prove that for each…

Fix a pair of relatively prime integers $n>k\ge 1$, and a point $(\eta\,|\,\tau)\in\mathbb{C}\times\mathbb{H}$, where $\mathbb{H}$ denotes the upper-half complex plane, and let ${{a\;\,b}\choose{c\,\;d}}\in\mathrm{SL}(2,\mathbb{Z})$. We…

Let $\tau$ denote the Ramanujan tau function. One is interested in possible prime values of $\tau$ function. Since $\tau$ is multiplicative and $\tau(n)$ is odd if and only if $n$ is an odd square, we only need to consider $\tau(p^{2n})$…

We treat two different equations involving powers of singular moduli. On the one hand, we show that, with two possible (explicitly specified) exceptions, two distinct singular moduli j(\tau),j(\tau') such that the numbers 1, j(\tau)^m and…

Planar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in an even number n of dimensions, the variables x_0,...,x_{n-1} being real numbers. The planar n-complex numbers can be described by the…