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

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…

We compute the Fourier coefficients of analogues of Kohnen and Zagier's modular forms $f_{k,D}$ of weight $2$ and negative discriminant. These functions can also be written as twisted traces of certain weight $2$ Poincar\'e series with…

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

Boundary value problems for integrable nonlinear evolution PDEs formulated on the finite interval can be analyzed by the unified method introduced by one of the authors and used extensively in the literature. The implementation of this…

In this paper, we propose a $\mu$-mode integrator for computing the solution of stiff evolution equations. The integrator is based on a $d$-dimensional splitting approach and uses exact (usually precomputed) one-dimensional matrix…

We study a canonical basis for spaces of weakly holomorphic modular forms of weights 12, 16, 18, 20, 22, and 26 on the full modular group. We prove a relation between the Fourier coefficients of modular forms in this canonical basis and a…

This paper describes several new improvements of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic applications. We further present a new…

Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…

Zagier proved that the traces of singular moduli, i.e., the sums of the values of the classical j-invariant over quadratic irrationalities, are the Fourier coefficients of a modular form of weight 3/2 with poles at the cusps. Using the…

Lehner's 1949 results on the $j$-invariant showed high divisibility of the function's coefficients by the primes $p\in\{2,3,5,7\}$. Expanding his results, we examine a canonical basis for the space of level $p$ modular functions holomorphic…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

The main purpose of this paper is to determine all normalized extremal quasimodular forms of depth 1 whose Fourier coefficients are integers. By changing the local parameter at infinity from $q=e^{2\pi i \tau}$ to the reciprocal of the…

Let $\lambda(n)$ denote the Fourier coefficients of a fixed modular form and $h(n)$ a Steinhaus or Rademacher random multiplicative function. In this paper, we determine the order of magnitude of \[ \E|\sum_{n \leq x} h(n)\lambda(n)|^{2q}…

We propose a new class of primal-dual Fejer monotone algorithms for solving systems of com- posite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the…

We present a symbolic-numeric method to refine an approximate isolated singular solution $\hat{\mathbf{x}}=(\hat{x}_{1}, ..., \hat{x}_{n})$ of a polynomial system $F=\{f_1, ..., f_n\}$ when the Jacobian matrix of $F$ evaluated at…

Carath\'eodory showed that $n$ complex numbers $c_1,...,c_n$ can uniquely be written in the form $c_p=\sum_{j=1}^m \rho_j {\epsilon_j}^p$ with $p=1,...,n$, where the $\epsilon_j$s are different unimodular complex numbers, the $\rho_j$s are…

The main result of this thesis is to show that there are only finitely many integers $n$ such that both $n$ and $d(n)$ are highly composite numbers at the same time, where $d(n)$ is the divisor function. Bertrand's postulate [4] is used…