相关论文: The hardness of computing an eigenform

Let $f$ be a normalized Hecke eigenform with rational integer Fourier coefficients. It is an interesting question to know how often an integer $n$ has a factor common with the $n$-th Fourier coefficient of $f$. The second author…

In the article, we consider a question concerning the estimation of summatory function of the Fourier coefficients of Hecke eigenforms indexed by a sparse set of integers. In particular, we provide an estimate for the following sum;…

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…

Given two Siegel eigenforms of different weights, we determine explicit sets of Hecke eigenvalues for the two forms that must be distinct. In degree two, and under some additional conditions, we determine explicit sets of Fourier…

The standard approach to evaluate Hecke eigenvalues of a Siegel modular eigenform F is to determine a large number of Fourier coefficients of F and then compute the Hecke action on those coefficients. We present a new method based on the…

In this paper, we define the multiplicative Hecke operators $\mathcal{T}(n)$ for any positive integer on the integral weight meromorphic modular forms for $\Gamma_{0}(N)$. We then show that they have properties similar to those of additive…

We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K. The modular strategy was conjectured to run in polynomial…

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

We study the space of period polynomials associated with modular forms of integral weight for finite index subgroups of the modular group. For the modular group, this space is endowed with a pairing, corresponding to the Petersson inner…

Using the framework relating hypergeometric motives to modular forms, we define an explicit family of weight 2 Hecke eigenforms with complex multiplication. We use the theory of ${}_2F_1(1)$ hypergeometric series and Ramanujan's theory of…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

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,…

In the paper, we introduce and calculate difference Fourier transforms on representations of the double affine Hecke algebras in polynomilas, polynomials multiplied by the Gaussian, and various spaces of delta-functions including…

We show that the Dirichlet series associated to the Fourier coefficients of a half-integral weight Hecke eigenform at squarefree integers extends analytically to a holomorphic function in the half-plane $\re s\textgreater{}\tfrac{1}{2}$.…

We establish lower bounds for (i) the numbers of positive and negative terms and (ii) the number of sign changes in the sequence of Fourier coefficients at squarefree integers of a half-integral weight modular Hecke eigenform.

Given an n x n matrix over the ring of differential polynomials F(t)[\D;\delta], we show how to compute the Hermite form H of A, and a unimodular matrix U such that UA=H. The algorithm requires a polynomial number of operations in terms of…

We introduce an alternate set of generators for the Hecka algebra, and give an explicit formula for the action of these operators on Fourier coefficients. With this, we compute the eigenvalues of Hecke operators acting on average Siegel…

This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…

In this paper we give a polynomial time algorithm to compute $\varphi(N)$ for an RSA module $N$ using as input the order modulo $N$ of a randomly chosen integer. This provides a new insight in the very important problem of factoring an RSA…