Related papers: Computing Jacobi's $\theta$ in quasi-linear time
Quantum computers can solve many number theory problems efficiently. Using the efficient quantum algorithm for order finding as an oracle, this paper presents an algorithm that computes the Carmichael function for any integer $N$ with a…
The family of left-to-right GCD algorithms reduces input numbers by repeatedly subtracting the smaller number, or multiple of the smaller number, from the larger number. This paper describes how to extend any such algorithm to compute the…
We show that for a Jacobi operator with coefficients whose (j+1)'th moments are summable the j'th derivative of the scattering matrix is in the Wiener algebra of functions with summable Fourier coefficients. We use this result to improve…
For arbitrary $\beta > 0$, we use the orthogonal polynomials techniques developed by R. Killip and I. Nenciu to study certain linear statistics associated with the circular and Jacobi $\beta$ ensembles. We identify the distribution of these…
Jacobi sums and cyclotomic numbers are the important objects in number theory. The determination of all the Jacobi sums and cyclotomic numbers of order $e$ are merely intricate to compute. This paper presents the lesser numbers of Jacobi…
We present a new package Theta.jl for computing with the Riemann theta function. It is implemented in Julia and offers accurate numerical evaluation of theta functions with characteristics and their derivatives of arbitrary order. Our…
We show that the eighth power of the Jacobi triple product is a Jacobi--Eisenstein series of weight $4$ and index $4$ and we calculate its Fourier coefficients. As applications we obtain explicit formulas for the eighth powers of…
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $\gcd(deg(P),deg(Q))\le 35$, and…
An important step in the efficient computation of multi-dimensional theta functions is the construction of appropriate symplectic transformations for a given Riemann matrix assuring a rapid convergence of the theta series. An algorithm is…
In this paper, we give some extensions for Ramanujan's circular summation formula with the mixed products of two Jacobi's theta functions. As some applications, we also obtain many interesting identities of Jacobi's theta functions.
We propose a new practical algorithm for computing the Feigenbaum constants {\alpha} and {\delta}, having significantly lower time and space complexity than previously used methods. The algorithm builds upon well-known linear algebra…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
We give improvements of the deformation method for computing the zeta function of a generic projective hypersurface in characteristic~$p$ that either reduce the dependence on~$p$ of the time complexity to $\tilde{O}(p^{1/2})$ or that of the…
In this paper we construct Donoghue $m$-functions for the Jacobi differential operator in $L^2\big((-1,1); (1-x)^{\alpha} (1+x)^{\beta} dx\big)$, associated to the differential expression \begin{align*} \begin{split} \tau_{\alpha,\beta} = -…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
Consider a family of distributions $\{\pi_{\beta}\}$ where $X\sim\pi_{\beta}$ means that $\mathbb{P}(X=x)=\exp(-\beta H(x))/Z(\beta)$. Here $Z(\beta)$ is the proper normalizing constant, equal to $\sum_x\exp(-\beta H(x))$. Then…
We use precise asymptotic expansions for Jacobi functions $\phi^{(\alpha,\beta)}_\lambda$ parameters $\alpha$, $\beta$ satisfying $\alpha>1/2$, $\alpha>\beta>-1/2$, to generalizing classical H\"ormander-type multiplier theorem for the…
We present an algorithm for doing Gibbs sampling on a quantum computer. The algorithm combines phase estimation for a Szegedy operator, and Grover's algorithm. For any $\epsilon>0$, the algorithm will sample a probability distribution in…
Spectral methods are an efficient way to solve partial differential equations on domains possessing certain symmetries. The utility of a method depends strongly on the choice of spectral basis. In this paper we describe a set of bases built…