English
Related papers

Related papers: Fast computation of half-integral weight modular f…

200 papers

A modular grid is a pair of sequences $(f_m)_m$ and $(g_n)_n$ of weakly holomorphic modular forms such that for almost all $m$ and $n$, the coefficient of $q^n$ in $f_m$ is the negative of the coefficient of $q^m$ in $g_n$. Zagier proved…

Number Theory · Mathematics 2022-05-13 Michael Griffin , Paul Jenkins , Grant Molnar

We compute a large number of moduli spaces of stable bundles on a general algebraic elliptic surface using a new class of Fourier-Mukai type transforms.

alg-geom · Mathematics 2008-02-03 Tom Bridgeland

We study the coefficients of a natural basis for the space of weak harmonic Maass forms of weight $5/2$ on the full modular group. The non-holomorphic part of the first element of this infinite basis encodes the values of the partition…

Number Theory · Mathematics 2014-10-28 Nickolas Andersen

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

This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…

Data Structures and Algorithms · Computer Science 2013-01-07 Lorenzo Pasquini

In many practical applications, spatial data are often collected at areal levels (i.e., block data) and the inferences and predictions about the variable at points or blocks different from those at which it has been observed typically…

Computation · Statistics 2020-01-10 Peter Simonson , Douglas Nychka , Soutir Bandyopadhyay

We classify ``arithmetic convection equations'' on modular curves, and describe their space of solutions. Certain of these solutions involve the Fourier expansions of the Eisenstein modular forms of weight 4 and 6, while others involve the…

Number Theory · Mathematics 2008-05-01 Alexandru Buium , Santiago R. Simanca

We consider some questions related to the signs of Hecke eigenvalues or Fourier coefficients of classical modular forms. One problem is to determine to what extent those signs, for suitable sets of primes, determine uniquely the modular…

Number Theory · Mathematics 2015-05-14 Emmanuel Kowalski , Yuk Kam Lau , Kannan Soundararajan , Jie Wu

We classify the moduli spaces of the four-dimensional topological half-flat gravity models by using the canonical bundle. For a K3-surface or four-dimensional torus, they describe an equivalent class of a trio of the Einstein-Kahler forms (…

High Energy Physics - Theory · Physics 2009-10-28 Mitsuko Abe

We carry out some computations of vector valued Siegel modular forms of degree two, weight (k,2) and level one. Our approach is based on Satoh's description of the module of vector-valued Siegel modular forms of weight (k, 2) and an…

Number Theory · Mathematics 2012-06-08 Alexandru Ghitza , Nathan C. Ryan , David Sulon

Unlike classical modular forms, there is currently no general way to implement the computation of Siegel modular forms of arbitrary weight, level and character, even in degree two. There is however, a way to do it in a unified way. After…

Number Theory · Mathematics 2012-06-05 Martin Raum , Nathan C. Ryan , Nils-Peter Skoruppa , Gonzalo Tornaría

Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…

Machine Learning · Computer Science 2020-08-31 Yong-chan Park , Jun-Gi Jang , U Kang

The moduli space of principally polarized abelian surfaces is parametrized by three Igusa functions. In this article we investigate a new way to evaluate these functions by using Siegel Eisenstein series. We explain how to compute the…

Number Theory · Mathematics 2011-01-24 Reinier Broker , Kristin Lauter

It is shown that if a function defined on the segment [-1,1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$,…

Number Theory · Mathematics 2010-08-31 Sergei N. Preobrazhenskii

Let $\G\subset \mathrm{SL}_{2}(\R)$ be a cofinite Fuchsian subgroup, and let $i\infty$ be a cusp of $\G$. For $k\in\Z_{\geq 0}$, let $\Sk$ denote the complex vector space of cusp forms of weight-$k$, with respect to the Fuchsian subgroup…

Number Theory · Mathematics 2019-03-15 Anilatmaja Aryasomayajula

The values of the partition function, and more generally the Fourier coefficients of many modular forms, are known to satisfy certain congruences. Results given by Ahlgren and Ono for the partition function and by Treneer for more general…

Number Theory · Mathematics 2023-03-22 Nathan C. Ryan , Zachary Scherr , Nicolás Sirolli , Stephanie Treneer

We present some results concerning the Saito module and the torsion submodule of an analytic plane curve, and we provide a method for computing them. Using this algorithm, we compute analytic invariants for plane curves with multiplicity…

Algebraic Geometry · Mathematics 2025-05-27 Emilio de Carvalho , Percy Fernández-Sánchez , Marcelo Escudeiro Hernandes

We analyze the coefficients of partition functions of Vafa-Witten theory for the complex projective plane $\mathbb{CP}^2$. We experimentally study the growth of the coefficients for gauge group $SU(2)$ and $SU(3)$, which are examples of…

High Energy Physics - Theory · Physics 2023-03-22 Aradhita Chattopadhyaya , Jan Manschot

The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…

Quantum Physics · Physics 2017-04-03 S. S. Zhou , T. Loke , J. A. Izaac , J. B. Wang

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…

Symbolic Computation · Computer Science 2025-07-10 Pascal Molin
‹ Prev 1 4 5 6 7 8 10 Next ›