Correction to "Explicit upper bound for the average number of divisors of irreducible quadratic polynomials"

Kostadinka Lapkova*

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

Consider the divisor sum (Formula presented.) for integers b and c. We improve the explicit upper bound of this average divisor sum in certain cases, and as an application, we give an improvement in the maximal possible number of (Formula presented.)-quadruples. The new tool is a numerically explicit Pólya–Vinogradov inequality, which has not been formulated explicitly before but is essentially due to Frolenkov–Soundararajan.

Original languageEnglish
Pages (from-to) 675–678
Number of pages4
JournalMonatshefte fur Mathematik
Volume186
Issue number4
Publication statusPublished - 24 Mar 2018

Keywords

  • Character sums
  • Number of divisors
  • Quadratic polynomial

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Correction to "Explicit upper bound for the average number of divisors of irreducible quadratic polynomials"'. Together they form a unique fingerprint.

Cite this