相关论文: The hardness of computing an eigenform

Let \tau(.) be the Ramanujan \tau-function, and let k be a positive integer such that \tau(n) is not 0 for n=1,...,[k/2]. (This is known to be true for k < 10^{23}, and, conjecturally, for all k.) Further, let s be a permutation of the set…

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of the logarithm of the Fourier transform of a distribution.We make this method algorithmic by developing a tensor decomposition method for a…

In this paper, we investigate the sign changes of Fourier coefficients of half-integral weight Hecke eigenforms and give two quantitative results on the number of sign changes.

Let $d(n)$ denote the number of divisors of $n$. In this paper, we study the average value of $d(a(p))$, where $p$ is a prime and $a(p)$ is the $p$-th Fourier coefficient of a normalized Hecke eigenform of weight $k \ge 2$ for $\Gamma_0(N)$…

We prove an algebraic property of the elements defining Hecke operators on period polynomials associated with modular forms, which implies that the pairing on period polynomials corresponding to the Petersson scalar product of modular forms…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

For each prime $\ell$, let $|\cdot|_\ell$ be an extension to $\bar \Q$ of the usual $\ell$-adic absolute value on $\Q$. Suppose $g(z) = \sum_{n=0}^\infty c(n)q^n \in M_{k+\half}(N)$ is an eigenform whose Fourier coefficients are algebraic…

In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…

We introduce an algebra $\mathcal H$ consisting of difference-reflection operators and multiplication operators that can be considered as a $q=1$ analogue of Sahi's double affine Hecke algebra related to the affine root system of type…

Let $p$ be a rational prime, let $q>1$ be a $p$-power integer, let $\mathbb{F}_q$ be the field of $q$ elements and let $A=\mathbb{F}_q[t]$ be the polynomial ring over $\mathbb{F}_q$. Let $\mathfrak{n}\in A$ be a nonzero element and let…

In this paper we study special bases of certain spaces of half-integral weight weakly holomorphic modular forms. We establish a criterion for the integrality of Fourier coefficients of such bases. By using recursive relations between Hecke…

We show that signs of Fourier coefficients, on certain sub-families, determine the half-integral weight cuspidal eigenform uniquely, up to a positive constant. We also study sign change results for the product of the Fourier coefficients of…

Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum…

We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), (Gao, 2001) designed a polynomial time algorithm that fails to factor only if the input polynomial…

This paper treats the problem of determining conditions for the Fourier coefficients of a Maass-Hecke newform at cusps other than infinity to be multiplicative. To be precise, the Fourier coefficients are defined using a choice of matrix in…

Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…

We give a new, simple proof of the trace formula for Hecke operators on modular forms for finite index subgroups of the modular group. The proof uses algebraic properties of certain universal Hecke operators acting on period polynomials of…

This paper is concerned with the fast computation of Fourier integral operators of the general form $\int_{\R^d} e^{2\pi\i \Phi(x,k)} f(k) d k$, where $k$ is a frequency variable, $\Phi(x,k)$ is a phase function obeying a standard…