Related papers: A fast amortized algorithm for computing quadratic…
An algorithm is given to factor an integer with $N$ digits in $\ln^m N$ steps, with $m$ approximately 4 or 5. Textbook quadratic sieve methods are exponentially slower. An improvement with the aid of an a particular function would provide a…
Assuming the Generalized Riemann Hypothesis (GRH), we utilize the long resonator method to derive $\Omega$-results for the family of quadratic Dirichlet $L$-functions $L(\sigma, \chi_d)$, where $d$ runs over all fundamental discriminants…
In this article, we apply the resonance method to derive conditional Omega results for logarithmic derivatives of quadratic Dirichlet $L$-functions. We improve a previous result of Mortada and Murty \cite{MM13}, as well as generalize some…
We present an algorithm to compute $\mathrm{LCLM}$-decompositions for linear differentials operators with coefficients in the rational function field of characteristic $p$, $\mathbb{F}_{p^n}(t)$. We show that for an operator $L$ of order…
Given a curve $C$ over a number field $K$ equipped with the action of a finite group $G$ by $K$-automorphisms, one obtains a factorisation of $L(C,s)$ into a product of $L$-functions of `motivic pieces of curves' associated to irreducible…
Assuming the Generalized Riemann Hypothesis, we establish explicit bounds in the $q$-aspect for the logarithmic derivative $\left(L'/L\right)\left(\sigma,\chi\right)$ of Dirichlet $L$-functions, where $\chi$ is a primitive character modulo…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
We consider moments of higher powers of quadratic Dirichlet character sums. In a restricted region, we give their asymptotic behavior by using de la Bret\`{e}che's multivariable Tauberian theorem. We also give the lower bound of the…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products…
We present some monotonicity results for Dirichlet $L$-functions associated to real primitive characters. We show in particular that these Dirichlet $L$-functions are far from being logarithmically completely monotonic. Also, we show that,…
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…
We derive formulas for the terms in the conjectured asymptotic expansions of the moments, at the central point, of quadratic Dirichlet $L$-functions, $L(1/2,\chi_d)$, and also of the $L$-functions associated to quadratic twists of an…
In this paper, we propose two simple yet efficient computational algorithms to obtain approximate optimal designs for multi-dimensional linear regression on a large variety of design spaces. We focus on the two commonly used optimal…
Given $c,$ a positive integer, we give an explicit formula and an asymptotic formula for \[ \sum\chi(c)|L(1,\,\chi)|^{2}, \] where $\chi$ is the non-trivial Dirichlet character mod $f$ with $f>c.$
We propose a numerical method for approximating and discovering zeros of the Dirichlet L-function L(s, chi) corresponding to real Dirichlet characters chi.
An algorithm is proposed, analyzed, and tested experimentally for solving stochastic optimization problems in which the decision variables are constrained to satisfy equations defined by deterministic, smooth, and nonlinear functions. It is…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
There has recently been some interest in optimizing the error term in the asymptotic for the fourth moment of Dirichlet L-functions and a closely related mixed moment of L-functions involving automorphic L-functions twisted by Dirichlet…
We establish sharp lower bounds for the $k$-th moment in the range $0 \leq k \leq 1$ of the family of quadratic Dirichlet $L$-functions at the central point.