相关论文: The hardness of computing an eigenform
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
Let $k$ and $n$ be positive even integers. For a Hecke eigenform $h$ in the Kohnen plus subspace of weight $k-n/2+1/2$ for $\varGamma_0(4)$, let $I_n(h)$ be the Duke-Imamoglu-Ikeda lift of $h$ to the space of cusp forms of weight $k$ for…
We present explicit formulas for Hecke eigenforms as linear combinations of q-analogues of modified double zeta values. As an application, we obtain period polynomial relations and sum formulas for these modified double zeta values. These…
We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
We prove multiplicative relations between certain Fourier coefficients of degree 2 Siegel eigenforms. These relations are analogous to those for elliptic eigenforms. We also provide two sets of formulas for the eigenvalues of degree 2…
We obtain an asymptotic formula for a weighted sum over cuspidal eigenvalues in a specific region, for $\SL_2$ over a totally real number field $F$, with discrete subgroup of Hecke type $\Gamma_0(I)$ for a non-zero ideal $I$ in the ring of…
We revisit Fermat's factorization method for a positive integer $n$ that is a product of two primes $p$ and $q$. Such an integer is used as the modulus for both encryption and decryption operations of an RSA cryptosystem. The security of…
We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known factoring algorithms…
A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…
We use Rankin--Cohen brackets on O(n, 2) to prove that the Fourier coefficients of reflective Borcherds products often satisfy congruences modulo certain primes.
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and…
Current asymmetric cryptography is based on the principle that while classical computers can efficiently multiply large integers, the inverse operation, factorization, is significantly more complex. For sufficiently large integers, this…
Determining the prime factors of a given number N is a problem, which requires super-polynomial time for conventional digital computers. A polynomial-time algorithm was invented by P. Shor for quantum computers. However, the realization of…
The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.