中文
相关论文

相关论文: On the estimate $M(x)=o(x)$ for Beurling generaliz…

200 篇论文

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

数论 · 数学 2019-11-22 Gregory Debruyne , Harold G. Diamond , Jasson Vindas

In this paper, we study the counting functions $\psi_\mathcal{P}(x)$, $N_\mathcal{P}(x)$ and $M_\mathcal{P}(x)$ of a generalized prime system $\mathcal{N}$. Here $M_\mathcal{P}(x)$ is the partial sum of the M\"{o}bius function over…

数论 · 数学 2019-10-18 Ammar Ali Neamah , Titus W Hilberdink

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

综合数学 · 数学 2023-02-24 Junda Pan

We give a short proof of the $L^{1}$ criterion for Beurling generalized integers to have a positive asymptotic density. We actually prove the existence of density under a weaker hypothesis. We also discuss related sufficient conditions for…

数论 · 数学 2019-08-13 Gregory Debruyne , Jasson Vindas

We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies…

数论 · 数学 2020-10-16 Frederik Broucke , Gregory Debruyne , Jasson Vindas

We provide some upper bounds for the Mertens function ($M(n)$: the cumulative sum of the M$\ddot{\mathrm{o}}$bius function) by an approach of statistical mechanics, in which the M$\ddot{\mathrm{o}}$bius function is taken as a particular…

综合数学 · 数学 2019-08-27 Rong Qiang Wei

We provide new sufficient conditions for Chebyshev estimates for Beurling generalized primes. It is shown that if the counting function $N$ of a generalized number system satisfies the $L^{1}$-condition $$…

数论 · 数学 2013-05-02 Jasson Vindas

Assuming the Riemann Hypothesis we establish an upper bound for the sum of the M{\" o}bius function up to $x$. Our method is based on estimating the frequency with which intervals of a given length can contain an unusual number of ordinates…

数论 · 数学 2008-02-13 K. Soundararajan

Let $M(x)=\sum_{1\le n\le x}\mu(n)$ where $\mu$ is the M\"obius function. It is well-known that the Riemann Hypothesis is equivalent to the assertion that $M(x)=O(x^{1/2+\epsilon})$ for all $\epsilon>0$. There has been much interest and…

数论 · 数学 2014-07-01 Lynnelle Ye

Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…

数论 · 数学 2013-05-02 Jasson Vindas

Let the summatory function of the M\"{o}bius function be denoted $M(x)$. We deduce in this article conditional results concerning $M(x)$ assuming the Riemann Hypothesis and a conjecture of Gonek and Hejhal on the negative moments of the…

数论 · 数学 2007-05-23 Nathan Ng

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…

数论 · 数学 2020-08-27 Victor Volfson

The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…

数论 · 数学 2017-09-05 Greg Hurst

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

数论 · 数学 2021-12-09 Victor Volfson

We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) =…

数论 · 数学 2017-08-24 Gregory Debruyne , Jasson Vindas

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis containing the M\"obius function. The estimate is remarkably sharp in comparison to estimates of other sums containing the M\"obius function.…

经典分析与常微分方程 · 数学 2017-05-30 Helmut Maier , Michael Th. Rassias

We present an elementary proof of the classical Beurling sampling theorem which gives a sufficient condition for sampling of multi-dimensional band-limited functions.

经典分析与常微分方程 · 数学 2011-06-06 Alexander Olevskii , Alexander Ulanovskii

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

数论 · 数学 2022-06-10 Qingyang Liu

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

数论 · 数学 2011-11-15 Karin Halupczok , Benjamin Suger

We give an estimate for sums appearing in the Nyman-Beurling criterion for the Riemann Hypothesis. These sums contain the M\"obius function and are related to the imaginary part of the Estermann zeta function. The estimate is remarkably…

经典分析与常微分方程 · 数学 2018-06-14 Helmut Maier , Michael Th. Rassias
‹ 上一页 1 2 3 10 下一页 ›