English

The Dirichlet-Bohr radius

Number Theory 2019-09-11 v1 Functional Analysis

Abstract

Denote by Ω(n)\Omega(n) the number of prime divisors of nNn \in \mathbb{N} (counted with multiplicities). For xNx\in \mathbb{N} define the Dirichlet-Bohr radius L(x)L(x) to be the best r>0r>0 such that for every finite Dirichlet polynomial nxanns\sum_{n \leq x} a_n n^{-s} we have nxanrΩ(n)suptRnxannit. \sum_{n \leq x} |a_n| r^{\Omega(n)} \leq \sup_{t\in \mathbb{R}} \big|\sum_{n \leq x} a_n n^{-it}\big|\,. We prove that the asymptotically correct order of L(x)L(x) is (logx)1/4x1/8 (\log x)^{1/4}x^{-1/8} . Following Bohr's vision our proof links the estimation of L(x)L(x) with classical Bohr radii for holomorphic functions in several variables. Moreover, we suggest a general setting which allows to translate various results on Bohr radii in a systematic way into results on Dirichlet-Bohr radii, and vice versa.

Keywords

Cite

@article{arxiv.1412.5947,
  title  = {The Dirichlet-Bohr radius},
  author = {Daniel Carando and Andreas Defant and Domingo García and Manuel Maestre and Pablo Sevilla-Peris},
  journal= {arXiv preprint arXiv:1412.5947},
  year   = {2019}
}
R2 v1 2026-06-22T07:37:04.989Z