Search arXivSearch

arXiv · 2008.05947

Joint universality on the half plane of absolute convergence

Abstract

We prove joint universality theorems on the half plane of absolute convergence for general classes of Dirichlet series with an Euler-product, where in addition to vertical shifts we also allow scaling. This generalizes our recent joint universality results for Dirichlet $L$-functions. In contrast to classical universality, we do not need that the Dirichlet series in question have an analytic continuation beyond their region of absolute convergence. Also we may allow weaker orthogonality conditions for pairs of Dirichlet series than in the previous joint universality results of Lee-Nakamura-Pańkowski. We take care to avoid using the Ramanujan conjecture in our proof and hence as a consequence of our universality theorem, we obtain stronger results on zeros of linear combinations of $L$-functions in the half plane of absolute convergence than previous results of Booker-Thorne and Righetti. For example as a consequence of our main universality result we have that certain linear combinations of Hecke $L$-series coming from Maass wave forms have infinitely many zeros in any strip $1<$Re$(s)<1+δ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johan Andersson. 2020-08-12. Joint universality on the half plane of absolute convergence. https://arxiv.org/abs/2008.05947

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT