相关论文: Computing central values of $L$-functions

A shift-invariant system is a collection of functions $\{g_{m,n}\}$ of the form $g_{m,n}(k) = g_m(k-an)$. Such systems play an important role in time-frequency analysis and digital signal processing. A principal problem is to find a dual…

In this paper, we study moments of the central values of quartic Dirichlet $L$-functions and establish quantitative non-vanishing result for these $L$-values.

The semivarying coefficient models are widely used in the application of finance, economics, medical science and many other areas. The functional coefficients are commonly estimated by local smoothing methods, e.g. local linear estimator.…

We consider the problem of approximate counting of triangles and longer fixed length cycles in directed graphs. For triangles, T\v{e}tek [ICALP'22] gave an algorithm that returns a $(1 \pm \eps)$-approximation in…

In this paper, we prove the extreme values of $L$-functions at the central point for almost prime quadratic twists of an elliptic curve. As an application, we get the extreme values for the Tate--Shafarevich groups in the quadratic twist…

Under certain conditions, we give an estimate from above on the number of differential equations of order $r+1$ with prescribed regular singular points, prescribed exponents at singular points, and having a quasi-polynomial flag of…

Computing the LZ factorization (or LZ77 parsing) of a string is a computational bottleneck in many diverse applications, including data compression, text indexing, and pattern discovery. We describe new linear time LZ factorization…

A number of applications require the computation of the trace of a matrix that is implicitly available through a function. A common example of a function is the inverse of a large, sparse matrix, which is the focus of this paper. When the…

We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter problem. In the \lbc problem, we are given a set of points P in a metric space and a lower bound \lambda, and the…

Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, ranging from routing to service placement. However, as…

Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a…

In a recent work arXiv:2004.14450, it has been shown that $L$-functions associated with arbitrary non-zero cusp forms take large values at the central critical point. The goal of this note is to derive analogous results for twists of…

In this paper, we study the first moment of central values of Hecke $L$-functions associated with quartic characters.

In this paper we prove rationality results of critical values for $L$-functions attached to representations in the residual spectrum of $\mathrm{GL}_4(\mathbb{A})$. We use the Jacquet-Langlands correspondence to describe their partial…

Metric estimates are quantities that approximate the word metric of a finitely presented group up to multiplicative constants. In this paper, they are computed for some nilpotent groups and used to compute the distortion functions of…

Using the $\scr L$-invariant constructed in our previous paper we prove a Mazur-Tate-Teitelbaum style formula for derivatives of p-adic L-functions of elliptic modular forms at near central points. In the second version of the paper the…

A rapidly convergent series, based on Taylor expansion of the imaginary part of the complex error function, is presented for highly accurate approximation of the Voigt/complex error function with small imaginary argument (Y less than 0.1).…

We present a fast Gauss transform in one dimension using nearly optimal sum-of-exponentials approximations of the Gaussian kernel. For up to about ten-digit accuracy, the approximations are obtained via best rational approximations of the…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…