English
Related papers

Related papers: Rapid computation of L-functions for modular forms

200 papers

In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function $\zeta(s)$ for all real $s$, $s>1$, in polynomial time and linear space on Turing machines in Ko-Friedman model. The algorithms is based on a…

Computational Complexity · Computer Science 2014-11-18 Sergey V. Yakhontov

Starting from some of Norman Levinson's results, we construct interesting examples of functions $f(s)$ such that for $s=\frac12+it$, we have $Z(t)=2\Re\{\pi^{-\frac{s}{2}}\Gamma(s/2)f(s)\}$. For example one such function is…

Number Theory · Mathematics 2024-07-08 Juan Arias de Reyna

We study sums of additively twisted Fourier coefficients of a holomorphic cusp form, a Maass cusp form, and the symmetric-square lift of a holomorphic cusp form. We obtain bounds that are uniform with respect to both the form and the terms…

Number Theory · Mathematics 2012-04-05 Daniel Godber

In this paper we obtain a sub-Weyl bound for $L(1/2+it,f)$ for $f$ a Hecke modular form.

Number Theory · Mathematics 2018-09-11 Ritabrata Munshi

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…

Combinatorics · Mathematics 2007-05-23 Guoce Xin

A practical method to compute the Riemann zeta function is presented. The method can compute $\zeta(1/2+it)$ at any $\lfloor T^{1/4} \rfloor$ points in $[T,T+T^{1/4}]$ using an average time of $T^{1/4+o(1)}$ per point. This is the same…

Number Theory · Mathematics 2018-08-31 G. A. Hiary

Let $f$ be a primitive Maass cusp form for a congruence subgroup $\Gamma_0(D) \subset $ SL($2,\mathbb{Z}$) and $\lambda_f(n)$ its $n$-th Fourier coefficient. In this paper it is shown that with knowledge of only finitely many $\lambda_f(n)$…

Number Theory · Mathematics 2016-11-09 Paul Savala

A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking…

Symbolic Computation · Computer Science 2023-07-21 Vincent Neiger , Bruno Salvy , Éric Schost , Gilles Villard

We study functions introduced by Knopp and complete them to non-holomorphic bimodular forms of positive integral weight related to indefinite binary quadratic forms. We investigate further properties of our completions, which in turn…

Number Theory · Mathematics 2026-01-14 Kathrin Bringmann , Andreas Mono

Let $F$ be a Hecke-Maa\ss\ cusp form for $\mathrm{SL}(3,\mathbb{Z})$. We obtain the first non-trivial upper bound of the second moment of $L(F,s)$ in $t$-aspect: $$\int_{T}^{2T}|L(F,1/2+it)|^2 dt\ll_{F,\varepsilon}…

Number Theory · Mathematics 2025-08-12 Sampurna Pal

We give coefficient formulas for antisymmetric vector-valued cusp forms with rational Fourier coefficients for the Weil representation associated to a finite quadratic module. The forms we construct always span all cusp forms in weight at…

Number Theory · Mathematics 2019-10-28 Brandon Williams

In this paper I introduce modular symbols for Maass wave cusp forms. They appear in the guise of finitely additive functions on the Boolean algebra generated by intervals with non--positive rational ends, with values in analytic functions…

Number Theory · Mathematics 2008-05-27 Yu I. Manin

The theories of hypergeometric functions and modular forms are highly intertwined. For example, particular values of truncated hypergeometric functions and hypergeometric character sums are often congruent or equal to Fourier coefficients…

Number Theory · Mathematics 2025-06-23 Michael Allen , Brian Grove , Ling Long , Fang-Ting Tu

We provide an explicit integral representation for L-functions of pairs (F,g) where F is a holomorphic genus 2 Siegel newform and g a holomorphic elliptic newform, both of squarefree levels and of equal weights. When F,g have level one,…

Number Theory · Mathematics 2009-01-17 Abhishek Saha

We present and discuss an algorithm and its implementation that is capable of directly determining Fourier expansions of any vector-valued modular form of weight at least $2$ associated with representations whose kernel is a congruence…

Number Theory · Mathematics 2023-04-24 Tobias Magnusson , Martin Raum

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…

Numerical Analysis · Computer Science 2011-10-28 Zhengjun Cao , Xiao Fan

Meher et al. [Proc. Amer. Math. Soc. 147 (2019)] have recently established that $L-$functions attached to certain cusp forms of half-integral weight have infinitely many zeros on the critical line. Kim [J. Numb. Th. 253 (2023)] obtained…

Number Theory · Mathematics 2023-11-21 Pedro Ribeiro

The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…

Optimization and Control · Mathematics 2017-11-10 Guillermo Gallego , Daniel Berjón , Narciso García

We give an algorithm to compute a one-dimensional shape-constrained function that best fits given data in weighted-$L_{\infty}$ norm. We give a single algorithm that works for a variety of commonly studied shape constraints including…

Data Structures and Algorithms · Computer Science 2019-05-30 David Durfee , Yu Gao , Anup B. Rao , Sebastian Wild

For a fix modular form g and a non negative ineteger {\nu}, by using Rankin-Cohen bracket we first define a linear map $T_{g,{\nu}}$ on the space of modular forms. We explicitly compute the adjoint of this map and show that the n-th Fourier…

Number Theory · Mathematics 2016-07-14 Abhash Kumar Jha , Arvind Kumar