Related papers: The hardness of computing an eigenform

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

In this paper we present a new efficient algorithm for factoring the RSA and the Rabin moduli in the particular case when the difference between their two prime factors is bounded. As an extension, we also give some theoretical results on…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

In this paper, we look at the problem of determining the composition factors for the affine graded Hecke algebra via the computation of Kazhdan-Lusztig type polynomials. We review the algorithms of \cite{L1,L2}, and use them in particular…

In a recent work, we found formulas for the Fourier coefficients of automorphic forms of type $G_2$: holomorphic Siegel modular forms on $\mathrm{Sp}_6$ that are theta lifts from $G_2^c$, and cuspidal quaternionic modular forms on split…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

We define Hilbert-Siegel modular forms and Hecke "operators" acting on them. As with Hilbert modular forms, these linear transformations are not linear operators until we consider a direct product of spaces of modular forms (with varying…

In this article, we discuss how a kind of hybrid computation, which employs symbolic, numeric, classic, and quantum algorithms, allows us to conduct Hartree-Fock electronic structure computation of molecules. In the proposed algorithm, we…

An \emph{indexing} of a finite set $S$ is a bijection $D : \{1,...,|S|\} \rightarrow S$. We present an indexing for the set of quadratic residues modulo $N$ that is decodable in polynomial time on the size of $N$, given the factorization of…

A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number…

In this paper we generalize the quantum algorithm for computing short discrete logarithms previously introduced by Eker{\aa} so as to allow for various tradeoffs between the number of times that the algorithm need be executed on the one…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

We report on a recent implementation of Giesbrecht's algorithm for factoring polynomials in a skew-polynomial ring. We also discuss the equivalence between factoring polynomials in a skew-polynomial ring and decomposing $p^s$-polynomials…

We shall introduce and study certain truncated sums of Hecke eigenvalues of $GL_2$-automorphic forms along quadratic polynomials. A power saving estimate is established and new applications to moments of critical $L$-values associated to…

Let $\Gamma$ be a congruence subgroup of $SL_2(Z)$, and let $f$ be a normalized eigenform of weight $k$ on $\Gamma$. Let $K$ denote the number field generated over $Q$ by the Fourier coefficients of $f$. Let $R$ denote the the order in $K$…

We present a variation of the modular algorithm for computing the Hermite normal form of an $\mathcal O_K$-module presented by Cohen, where $\mathcal O_K$ is the ring of integers of a number field $K$. An approach presented in (Cohen 1996)…

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a…