Related papers: The hardness of computing an eigenform

We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…

Fix a prime number p and choose, once and for all, an embedding of the algebraic closure of Q into Qp. Let k and N be integers, and suppose N is not divisible by p. If f is a modular form of weight k, level N, and trivial character which is…

We present a deterministic algorithm for computing all irreducible factors of degree $\le d$ of a given bivariate polynomial $f\in K[x,y]$ over an algebraic number field $K$ and their multiplicities, whose running time is polynomial in the…

We study sums of Hecke eigenvalues of Hecke-Maass cusp forms for the group $\mathrm{SL}(n,\mathbb Z)$, with general $n\geq 3$, over certain short intervals under the assumption of the generalised Lindel\"of hypothesis and a slightly…

We study polynomials interpolating the (rational) constant terms of certain meromorphic modular forms for Hecke groups. We make observations about the divisibility properties of the constant terms and connect them to several sequences, for…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…

Denoting by $P_N(A,\theta)=\det(I-Ae^{-i\theta})$ the characteristic polynomial on the unit circle in the complex plane of an $N\times N$ random unitary matrix $A$, we calculate the $k$th moment, defined with respect to an average over…

We construct algorithms that efficiently generate random factorisations of values $P(n)$ as products of two integers, where $P\in\mathbb{Z}[x]$ is a given quadratic or cubic monic polynomial. In other words, the algorithms produce random…

In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…

In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…

We attach Hecke polynomials $P_n(F;x)$ to weak Hecke eigenforms $F$ of weight $2-k$ and show that, for large $n$, every zero is simple and lies in $[0,1728]$. The construction pulls back a weakly holomorphic Hecke combination of $F$ along…

We give formulae for the multiplicities of eigenvalues of generalized rotation operators in terms of generalized Frobenius-Schur indicators in a semisimple spherical tensor category $\mathcal{C}$. In particular, this implies that the entire…

An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…

Let $\mathfrak{g}$ be a semisimple Lie algebra over $\mathbb{C}$ having rank $l$ and let $V=L(\lambda)$ be an irreducible finite-dimensional $\mathfrak{g}$-module having highest weight $\lambda.$ Computations of weight multiplicities in…

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

Over any fixed totally real number field with narrow class number one, we prove that the Rankin-Cohen bracket of two Hecke eigenforms for the Hilbert modular group can only be a Hecke eigenform for dimension reasons, except for a couple of…

Let $\lambda(n)$ denote the Fourier coefficients of a fixed modular form and $h(n)$ a Steinhaus or Rademacher random multiplicative function. In this paper, we determine the order of magnitude of \[ \E|\sum_{n \leq x} h(n)\lambda(n)|^{2q}…

Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural…