相关论文: The hardness of computing an eigenform

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…

We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…

Homomorphic encryption (HE) allows computations to be directly carried out on ciphertexts and enables privacy-preserving cloud computing. The computations on the coefficients of the polynomials involved in HE are always followed by modular…

We will characterize the Eisenstein series for O(2, n + 2) as a particular Hecke eigenform. As an application we show that it belongs to the associated Maa{\ss} space. If the underlying lattice is even and unimodular, this leads to an…

We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our…

Hecke eigenvalues of classical modular forms often encode a wealth of arithmetic data. The Satake $p$-parameters of a Siegel modular form play a role analogous to the one played by Hecke eigenvalues in the characterization of classical…

We obtain new lower bounds for the number of Fourier coefficients of a weakly holomorphic modular form of half-integral weight not divisible by some prime $\ell$. Among the applications of this we show that there are $\gg \sqrt{X}/\log \log…

The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…

Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…

This article is concerned with the Fourier coefficients of cusp forms (not necessarily eigenforms) of half-integer weight lying in the plus space. We give a soft proof that there are infinitely many fundamental discriminants $D$ such that…

We develop an explicit theory of formal modular forms over arbitrary number fields $K$, as functions of modular points. We define modular points for $\Gamma_0({\mathfrak n})$ and $\Gamma_1({\mathfrak n})$, where the level ${\mathfrak n}$ is…

Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as…

Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…

We propose a novel algorithm for finding square roots modulo p. Although there exists a direct formula to calculate square root of an element modulo prime (3 mod 4), but calculating square root modulo prime (1 mod 4) is non trivial.…

In this work, we consider the proportion of smooth (free of large prime factors) values of a binary form $F(X_1,X_2)\in\Z[X_1,X_2]$. In a particular case, we give an asymptotic equivalent for this proportion which depends on $F$. This is…

A scheme to encode arbitrarily long integer pairs on degenerate optical parametric oscillations multiplexed in time is proposed. The classical entanglement between the polarization directions and the phases of the oscillating pulses,…

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…

In this paper we prove a number of theorems that determine the extent to which the signs of the Hecke eigenvalues of an Eisenstein newform determine the newform. We address this problem broadly and provide theorems of both individual and…