Searcharxiv⌕ Search

arXiv subjects

Valeriia V. Starichkova

Publications and source records attributed to Valeriia V. Starichkova.

4 recordsLinked to original sources

On Lenstra's criterion for norm-Euclideanity of number fields and properties of Dedekind zeta-functions

In 1977, Lenstra provided a criterion for norm-Euclideanity of number fields and noted that this criterion becomes ineffective for number fields of large enough degrees under the Generalised Riemann Hypothesis (GRH) for the Dedekind zeta-functions. In the first part of the paper we make Lenstra's observation explicit by proving that, under GRH, the criterion becomes ineffective for all number fields of degree $n \geq 62238$. This follows from combining the criterion assumption with the explicit lower bound for the discriminant of $K$ under GRH, and the (trivial) upper bound for the minimal proper ideal norm in $\mathcal{O}_K$. Unconditionally, the lower bound for the discriminant is too weak to lead to such a contradiction. However, we show that GRH can be replaced by another condition on the Dedekind zeta functions $ζ_K$, a conjectural lower bound for $ζ_K$ at a point to the right of $s = 1$. Combined with Zimmert's approach, this condition implies a different type of upper bound for the minimal proper ideal norm and again contradicts Lenstra's criterion for all $n$ large enough. The advantage of the new potential condition on $ζ_K$ is that it can be computationally checked for number fields of not too large degrees.

math.NT↗

Some explicit results on the sum of a prime and an almost prime

Inspired by a classical result of Rényi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis, that this result can be improved to 31 prime factors.

math.NT↗

Atkinson's formula for the mean square of $ζ(s)$ with an explicit error term

We provide an explicit $O\left(\log^2{T}\right)$-term of the celebrated Atkinson's formula for the error term $E(T)$ of the second power moment of the Riemann zeta-function on the critical line. As an application, we obtain an explicit version of well-known estimate $E(T)\ll_{\varepsilon} T^{\frac{1}{3}+\varepsilon}$.

math.NT↗

Explicit lower bounds on $|L(1, χ)|$

Let $χ$ denote a primitive, non-quadratic Dirichlet character with conductor $q$, and let $L(s, χ)$ denote its associated Dirichlet $L$-function. We show that $|L(1, χ)| \geq 1/(9.12255 \log(q/π))$ for sufficiently large $q$, and that $|L(1, χ)| \geq 1/(9.69030 \log(q/π))$ for all $q\geq2$, improving some results of Louboutin. The improvements stem principally from the construction, via simulated annealing, of some real trigonometric polynomials having particularly favorable properties.

math.NT↗