17 citations · 44 across the 7 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.NT2011
On a problem of Dobrowolski--Williams
Dmitriy Frolenkov
In this paper we prove new upper bounds for the sum , for a certain class of arithmetic functions . Our results improve the previous results of G. Bachma…
math.NT2011★ 2 cited
Numerically explicit version of the Pólya--Vinogradov inequality
Dmitriy Frolenkov
In this paper we proved a new numerically explicit version of the Pólya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequali…