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

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

We present two algorithms that, given a prime ell and an elliptic curve E/Fq, directly compute the polynomial Phi_ell(j(E),Y) in Fq[Y] whose roots are the j-invariants of the elliptic curves that are ell-isogenous to E. We do not assume…

We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic.…

Traces of singular moduli were introduced and studied by Zagier in 1998. Being simultaneously the (traces of) values of a modular function ($j$-invariant) and Fourier coefficients of modular forms - which constitutes Zagier's duality -…

We provide a simple and new induction based treatment of the problem of distinguishing cusp forms from the growth of the Fourier coefficients of modular forms. Our approach gives the best possible ranges of the weights for this problem, and…

We show how one can use non-prime-power, composite moduli for computing representations of the product of two $n\times n$ matrices using only $n^{2+o(1)}$ multiplications.

In this article we shall study the following elliptic system with coefficients: \begin{equation}\notag \left\{\begin{aligned} -\epsilon^2\Delta u +c(x)u=b(x)|v|^{q-1}v, &\text{ and } -\epsilon^2\Delta v +c(x)v=a(x) |u|^{p-1}u &&\text{in }…

Suppose $j_N(\tau)$ and $j_N^{*}(\tau)$ are the Hauptmoduln of the congruence subgroup $\Gamma_0(N)$ and the Fricke group $\Gamma^{*}_0(N)$, respectively. In [7], the authors predicted that, like Klein's $j$-function, the Fourier…

Special arithmetic series $f(x)=\sum_{n=0}^{\infty}c_nx^n$, whose coefficients $c_n$ are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation…

In this note, we show that the algebraicity of the Fourier coefficients of half-integral weight modular forms can be determined by checking the algebraicity of the first few of them. We also give a necessary and sufficient condition for a…

We propose three kinds of explicit formulas for the elliptic lambda function by the elliptic modular function. Further, we derive incredible cubic identities as a corollary of our explicit formulas and evaluate some singular values of the…

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…

We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…

Let $\alpha\in]0,1]$ and let $Q_j$ $(1\leqslant j\leqslant r)$ denote distinct irreducible polynomials with integer coefficients. We show that, for vectors with coordinates not exceeding a constant multiple of their mean, the joint local…

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Here we present an efficient method to compute Darboux polynomials for polynomial vector fields in the plane. This approach is restricetd to polynomial vector fields presenting a Liouvillian first integral (or, equivalently, to rational…

We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…

We describe the complex multiplication (CM) values of modular functions for $\Gamma_0(N)$ whose divisor is given by a linear combination of Heegner divisors in terms of special cycles on the stack of CM elliptic curves. In particular, our…