Related papers: A fast amortized algorithm for computing quadratic…

We compute the second moment in the family of quadratic Dirichlet $L$-functions with prime conductors over $\mathbb{F}_q[x]$ when the degree of the discriminant goes to infinity, obtaining one of the lower order terms. We also obtain an…

We give a fast, exact algorithm for solving Dirichlet problems with polynomial boundary functions on quadratic surfaces in R^n such as ellipsoids, elliptic cylinders, and paraboloids. To produce this algorithm, first we show that every…

We obtain an asymptotic formula for the smoothly weighted first moment of primitive quadratic Dirichlet L-functions at the central point, with an error term that is "square-root" of the main term. Our approach uses a recursive technique…

We investigate various mean value problems involving order three primitive Dirichlet characters. In particular, we obtain an asymptotic formula for the first moment of central values of the Dirichlet L-functions associated to this family,…

We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for…

We study the first moment of primitive quadratic Dirichlet $L$-functions. Assuming the Riemann hypothesis and the generalized Lindel\"of hypothesis, we obtain an asymptotic formula at the central point with error $O(X^{1/4+\epsilon})$, and…

All known algorithms for the Fr\'echet distance between curves proceed in two steps: first, they construct an efficient oracle for the decision version; second, they use this oracle to find the optimum from a finite set of critical values.…

Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…

We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyze the arithmetic complexity of existing algorithms for LCLMs, as well as the size of their outputs. We…

This paper develops an analytic theory of Dirichlet series in several complex variables which possess sufficiently many functional equations. In the first two sections it is shown how straightforward conjectures about the meromorphic…

We deal with negative square moments of Dirichlet $L$-functions. Summing over characters modulo $q$, we obtain an asymptotic formula for the negative second moment of $L(1,\chi)$ involving conductors. As an application, we give the improved…

We present an algorithm for factoring linear differential operators with coefficients in a finite separable extension of F p (x). Our methods rely on specific tools arising in positive characteristic: p-curvature, structure of simple…

We consider a sum of the derivatives of Dirichlet $L$-functions over the zeros of Dirichlet $L$-functions. We give an asymptotic formula for the sum.

Double $L$-functions are the generalization of Dirichlet $L$-functions to two variable functions. We investigate the order estimation of double $L$-functions, and give upper bounds which are explicit in conductor aspect.

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 the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…

We prove that the Dirichlet $L$-functions associated with Dirichlet characters in $\mathbb{F}_{q}[x]$ are universal. That is, given a modulus of high enough degree, $L$-functions with characters to this modulus can be found that approximate…

We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…

The Dedekind zeta function of a quadratic number field factors as a product of the Riemann zeta function and the $L$-function of a quadratic Dirichlet character. We categorify this formula using objective linear algebra in the abstract…

In this series, we investigate the calculation of mean values of derivatives of Dirichlet $L$-functions in function fields using the analogue of the approximate functional equation and the Riemann Hypothesis for curves over finite fields.…