Related papers: Computing the residue of the Dedekind zeta functio…

Let $\psi_{\mathbb K}$ be the Chebyshev function of a number field $\mathbb K$. Let $\psi^{(1)}_{\mathbb K}(x):=\int_{0}^{x}\psi_{\mathbb K}(t)\,d t$ and $\psi^{(2)}_{\mathbb K}(x):=2\int_{0}^{x}\psi^{(1)}_{\mathbb K}(t)\,d t$. We prove…

In this paper, we compare the two definitions of Bloch group, and survey the elements in Bloch group. We confirm the Lichtenbaum conjecture on the field $Q(\zeta_p)$ under the assumption the truth of the base of the Bloch group of…

New expansions for some functions related to the Zeta function in terms of the Pochhammer's polynomials are given (coefficients b(k), d(k), d_(k) and d__(k). In some formal limit our expansion b(k) obtained via the alternating series gives…

For a positive integer k and an arbitrary integer h, the Dedekind sum s(h,k) was first studied by Dedekind because of the prominent role it plays in the transformation theory of the Dedekind eta-function, which is a modular form of weight…

We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant $\Delta_K$, given a full-rank subgroup as input, in asymptotically fewer bit operations than the baby-step giant-step…

We improve the error terms in the Davenport-Heilbronn theorems on counting cubic fields to $O(X^{2/3 + \epsilon})$. This improves on separate and independent results of the authors and Shankar and Tsimerman. The present paper uses the…

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed B(k) for k = 10^8, a new record. Our method is to compute B(k) modulo p for many small primes p, and then reconstruct B(k) via the…

Given a number field $K$ one associates to it the set $\Lambda_K$ of Dedekind zeta-functions of finite abelian extensions of $K$. In this short note we present a proof of the following Theorem: for any number field $K$ the set $\Lambda_K$…

We establish new explicit zero-free regions for the Dedekind zeta-function. Two key elements of our proof are a non-negative, even, trigonometric polynomial and explicit upper bounds for the explicit formula of the so-called differenced…

The paper describes a method for calculating values of Riemann's Zeta function within the critical strip 0< {\sigma} <1 and on its boundary. The approach is based on the "Alternating Zeta function" {\eta}(s). The actual Riemann Zeta…

Some computations made about the Riemann Hypothesis and in particular, the verification that zeroes of zeta belong on the critical line and the extension of zero-free region are useful to get better effective estimates of number theory…

We show that the generalized Riemann hypothesis implies that there are infinitely many consecutive zeros of the Riemann zeta function whose spacing is 2.9125 times larger than the average spacing. This is deduced from the calculation of the…

Here we study problems related to the proportions of zeros, especially simple and distinct zeros on the critical line, of Dedekind zeta functions. We obtain new bounds on a counting function that measures the discrepancy of the zeta…

We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…

Let $L$ be a number field. For a given prime $p$ we define integers $\alpha_{p}^{L}$ and $\beta_{p}^{L}$ with some interesting arithmetic properties. For instance, $\beta_{p}^{L}$ is equal to $1$ whenever $p$ does not ramify in $L$ and…

All sieve methods for the Goldbach problem sift out all the composite numbers; even though, strictly speaking, it is not necessary to do so and which is, in general, very difficult. Some new methods introduced in this paper show that the…

In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise…