English
Related papers

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

200 papers

An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate…

Number Theory · Mathematics 2012-06-18 Richard Sladkey

A number theoretical model of $1/f$ noise found in phase locked loops is developed. The dynamics of phases and frequencies involved in the nonlinear mixing of oscillators and the low-pass filtering is formulated thanks to the rules of the…

High Energy Physics - Theory · Physics 2007-05-23 Michel Planat

Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…

Algebraic Geometry · Mathematics 2022-06-03 Valentin Petit

We present an efficient algorithm to compute the Euler factor of a genus 2 curve C/Q at an odd prime p that is of bad reduction for C but of good reduction for the Jacobian of C (a prime of ``almost good'' reduction). Our approach is based…

Number Theory · Mathematics 2025-04-18 Céline Maistret , Andrew V. Sutherland

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

Analysis of PDEs · Mathematics 2015-05-30 A. S. Fokas , J. Lenells

Ramanujan showed that $\tau(p) \equiv p^{11}+1 \pmod{691}$, where $\tau(n)$ is the $n$-th Fourier coefficient of the unique normalized cusp form of weight $12$ and full level, and the prime $691$ appears in the numerator of…

Number Theory · Mathematics 2024-03-07 Ellise Parnoff , A. Raghuram

The series of some new estimates for the sums of the type \[ S_{q}(x;f)\,=\,\mathop{{\sum}'}\limits_{n\leqslant x}f(n)e_{q}(an^{*}+bn) \] is obtained. Here $q$ is a sufficiently large integer, $\sqrt{q}(\log{q})\!\ll\!x\leqslant q$, $a,b$…

Number Theory · Mathematics 2018-04-05 M. A. Korolev

The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…

Number Theory · Mathematics 2020-11-24 Jitendra Bajpai , Subham Bhakta , Victor C. Garcia

Taylor series methods show a newfound promise for the solution of non-stiff ordinary differential equations (ODEs) given the rise of new compiler-enhanced techniques for calculating high order derivatives. In this paper we detail a new…

Numerical Analysis · Mathematics 2026-02-20 Songchen Tan , Oscar Smith , Christopher Rackauckas

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real…

Symbolic Computation · Computer Science 2011-04-27 Elias Tsigaridas

The first order by time partial differential equations are used as models in applications such as fluid flow, heat transfer, solid deformation, electromagnetic waves, and others. In this paper we propose the new numerical method to solve a…

Numerical Analysis · Mathematics 2008-01-14 Ivan Kazachkov

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

Number Theory · Mathematics 2025-11-04 Boyuan Xiong

We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…

Number Theory · Mathematics 2017-07-26 Christian J. Berghoff

We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).

Number Theory · Mathematics 2013-05-02 David Harvey

Zagier proved that the traces of singular values of the classical j-invariant are the Fourier coefficients of a weight 3/2 modular form and Duke provided a new proof of the result by establishing an exact formula for the traces using…

Number Theory · Mathematics 2007-05-23 Dohoon Choi , Daeyeol Jeon , Soon-Yi Kang , Chang Heon Kim

In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes…

Number Theory · Mathematics 2013-05-21 Jinxiang Zeng

We present a unified fermionic approach to compute the tau-functions and the n-point functions of integrable hierarchies related to some infinite-dimensional Lie algebras and their representations.

Mathematical Physics · Physics 2015-08-11 Jian Zhou

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)+…

Number Theory · Mathematics 2018-08-06 Zafer Selcuk Aygin

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

We give a list of $113$ holomorphic eta-quotients of integral weight ($66$ of which are primitive) and provide a uniform closed formula for their Fourier coefficients $c(l)$ where $l\equiv1\bmod{m}$ with some fixed $m\mid24$. The proof…

Number Theory · Mathematics 2025-09-11 Xiao-Jie Zhu