相关论文: The hardness of computing an eigenform
The Fourier coefficients of a Maass form $\phi$ for SL$(n,\mathbb Z)$ are complex numbers $A_\phi(M)$, where $M=(m_1,m_2,\ldots,m_{n-1})$ and $m_1,m_2,\ldots ,m_{n-1}$ are nonzero integers. It is well known that coefficients of the form…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
In this paper we address two different problems related with the factorization of an RSA module N. First we can show that factoring is equivalent in deterministic polynomial time to counting points on a pair of twisted Elliptic curves…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) 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 note, we explicitly construct mock modular forms with integral Fourier coefficients by evaluating regularized Petersson inner products involving their shadows, which are unary theta functions of weights 1/2 and 3/2 . In addition, we…
For a Baer-local (composition) Fitting formation $\mathfrak{F}$ the polynomial time algorithm for the computation of the $\mathfrak{F}$-radical of a permutation group is suggested. In particular it is showed how one can compute the…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
In this article, we investigate large prime factors of Fourier coefficients of non-CM normalized cuspidal Hecke eigenforms in short intervals. One of the new ingredients involves deriving an explicit version of Chebotarev density theorem in…
Let $F$ (over $\mathbb{Q}$) be a totally real number field of narrow class number $1$. We generalize a result of Kohnen on the determination of half integral weight modular forms by their Fourier coefficients supported on squarefree…
We solve an open problem proposed in the book ``Computing the continuous discretely" written by Matthias Beck and Sinai Robins. That is, we proposed a polynomial time algorithm for calculating Fourier-Dedekind sums. The algorithm is simple…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
The best deterministic unconditionally proven integer factorization algorithms have exponential running time complexities of O(N^(1/4)) arithmetic operations, and conditional on the Riemann hypothesis, there is a deterministic algorithm of…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We present SPEC-RE, a new algorithm to sort complex eigenvalues, generated as the solutions to algebraic equations, whose coefficients are analytic functions of one or many, possibly complex parameters. The fact that the eigenvalues are…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix $\mathbf{H}$ and its inverse $\mathbf{H}^{-1}$ as $\mathbf{B}\mathbf{B}^*$ under fixed-point arithmetic. If solved, these would…
We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…
The theoretical aspects of four integer factorization algorithms are discussed in details in this note. The focus is on the performances of these algorithms on the subset of hard to factor balanced integers N = pq, p < q < 2p. The running…