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

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…

For any given integer $k\geq 2$ we prove the existence of infinitely many $q$ and characters $ \chi\pmod q$ of order $k$, such that $|L(1,\chi)|\geq (e^{\gamma}+o(1))\log\log q$. We believe this bound to be best possible. When the order $k$…

Let $L(s,\chi)$ be the Dirichlet $L$-function associated to a non trivial primitive Dirichlet character $\chi$ defined $\bmod\ q$, where $q$ is an odd prime. In this paper we introduce a fast method to compute $\vert L(1,\chi) \vert$ using…

The integer complexity $f(n)$ of a positive integer $n$ is defined as the minimum number of 1's needed to represent $n$, using additions, multiplications and parentheses. We present two simple and faster algorithms for computing the integer…

We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated with primitive characters of modulus…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Let $m\ge 1$ be a rational integer. We give an explicit formula for the mean value $$\frac{2}{\phi(f)}\sum_{\chi (-1)=(-1)^m}\vert L(m,\chi )\vert^2,$$ where $\chi$ ranges over the $\phi (f)/2$ Dirichlet characters modulo $f>2$ with the…

A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking…

We propose a rather elementary method to compute a certain family of integrals on the half line, depending on the integer parameters $n\geq q\geq 1$.

We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…

We discuss theoretical and algorithmic questions related to the $p$-curvature of differential operators in characteristic $p$. Given such an operator $L$, and denoting by $\Chi(L)$ the characteristic polynomial of its $p$-curvature, we…

Let C(q,+) be the set of even, primitive Dirichlet characters (mod q). Using the mollifier method we show that L^{(k)}(1/2,chi) is not equal to zero for almost all the characters chi in C(q,+) when k and q are large. Here, L^{(k)}(s,chi) is…

Let $L$ be a degree-$2$ $L$-function associated to a Maass cusp form. We explore an algorithm that evaluates $t$ values of $L$ on the critical line in time $O(t^{1+\varepsilon})$. We use this algorithm to rigorously compute an abundance of…

For a given cusp form $\phi$ of even integral weight satisfying certain hypotheses, Waldspurger's Theorem relates the critical value of the $\mathrm{L}$-function of the $n$-th quadratic twist of $\phi$ to the $n$-th coefficient of a certain…

We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…

For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…

We extend the work of Fouvry, Kowalski and Michel on correlation between Hecke eigenvalues of modular forms and algebraic trace functions in order to establish an asymptotic formula for a generalized cubic moment of modular L-functions at…

Let $\chi$ be a Dirichlet character modulo $q$, let $L(s, \chi)$ be the attached Dirichlet $L$-function, and let $L^\prime(s, \chi)$ denotes its derivative with respect to the complex variable $s$. The main purpose of this paper is to give…