相关论文: Computing special values of motivic L-functions
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
In this paper we give a formula for the central value of the completed $L$-function $L(s,Sym^{2} g\times f)$, where $f$ and $g$ are Hilbert newforms, by explicitly computing the local integrals appearing in the refined Gan-Gross-Prasad…
Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…
In this work we show that it is possible to calculate the fractional integrals and derivatives of order $\alpha$ (using the Riemann-Liouville formulation) of power functions $\left( t-\ast\right) ^{\beta}$ with $\beta$ being any real value,…
Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…
We show the existence of ``good'' approximations to a real number $\gamma$ using rationals with denominators formed by digits $0$ and $1$ in base $b$. We derive an elementary estimate and enhance this result by managing exponential sums.
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
For any polynomial f with complex coefficients we find a remarkable subset of poles of the motivic zeta function. It is combinatorially determined by any log resolution and it admits an intrinsic interpretation in terms of contact loci of…
By introducing a class of meromorphic functions with certain ramification structures on $\Bbb{CP}^1$, a new method for the determination of the Legendre representation of elliptic curves with complex multiplication is introduced. These…
In this paper, we investigate the determinants involving some trigonometric functions. We establish a connection between these determinants and the special values of Dirichlet L-functions, thereby extending Guo's results to arbitrary…
We present a method for computing the zeta function of a smooth projective variety over a finite field which proceeds by induction on the dimension. We have implemented our approach for some surfaces using the Magma programming language,…
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.
The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading…
We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.
In this paper, we completely determine the slopes and weights of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and…
Matrix functions with potential applications have a major role in science and engineering. One of the fundamental matrix functions, which is particularly important due to its connections with certain matrix differential equations and other…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…