Related papers: A Fast Algorithm to Compute l(1/2, f x \chi_q)

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…

Generalizing our previous work on ``toroidal averages'', we study the average of special values of $L$-functions of the form $L(1/2,\chi^a)L(1/2,\chi^b)L(1/2,\chi^c)$ for integers $a$, $b$ and $c$, where $\chi$ varies over Dirichlet…

Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…

We present a fast algorithm for modular exponentiation when the factorization of the modulus is known. Let $a,n,m$ be positive integers and suppose $m$ factors canonically as $\prod_{i=1}^k p_i^{e_i}$. Choose integer parameters $t_i\in [1,…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

In this article, we focus on computing the quantiles of a random variable $f(X)$, where $X$ is a $[0,1]^d$-valued random variable, $d \in \mathbb{N}^{\ast}$, and $f:[0,1]^d\to \mathbb{R}$ is a deterministic Lipschitz function. We are…

This note presents fast Cholesky/LU/QR decomposition algorithms with $O(n^{2.529})$ time complexity when using the fastest known matrix multiplication. The algorithms have potential application, since a quickly made implementation using…

For $f$ a primitive holomorphic cusp form of even weight $k \geq 4$, level $N$, and $\chi$ a Dirichlet character mod $Q$ with $(Q,N)=1$, we establish a new hybrid subconvexity bound for $L(1/2 + it, f_\chi)$, which improves upon all known…

For a fairly general family of L-functions, we survey the known consequences of the existence of asymptotic formulas with power-sawing error term for the (twisted) first and second moments of the central values in the family. We then…

We propose a new class of semi-implicit methods for solving nonlinear fractional differential equations and study their stability. Several versions of our new schemes are proved to be unconditionally stable by choosing suitable parameters.…

A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…

We present simple and efficient algorithms for calculating $q$-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size $n$ that represents string $T$, we present an $O(qn)$…

The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…

The main purpose of this paper is to establish bounds on the second moment of $L\big(\tfrac{1}{2}+it,\chi\big)$, averaged over families of fixed order characters. A discrete version of the main result is also stated, from which zero-density…

A new integer deterministic factorization algorithm, rated at arithmetic operations to $O(N^{1/6+\varepsilon})$ arithmetic operations, is presented in this note. Equivalently, given the least $(\log N)/6$ bits of a factor of the balanced…

We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).

We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…