Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMean square of the error term in the asymmetric many dimensional divisor problem
161
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $ba=(a_1,a_2,ldots,a_k)$, where $a_j (j=1,ldots,k)$ are positive integers such that $a_1 leq a_2 leq cdots leq a_k$. Let $d(ba;n)=sum_{n_1^{a_1}cdots n_k^{a_k}=n}1$ and $Delta(ba;x)$ be the error term of the summatory function of $d(ba;n)$. In this paper we show an asymptotic formula of the mean square of $Delta(ba;x)$ under a certain condition. Furthermore, in the cases $k=2$ and 3, we give unconditional asymptotic formulas for these mean squares.
rate research
Read More
In 1956, Tong established an asymptotic formula for the mean square of the error term in the summatory function of the Piltz divisor function $d_3(n).$ The aim of this paper is to generalize Tongs method to a class of Dirichlet series that satisfy a functional equation. As an application, we can establish the asymptotic formulas for the mean square of the error terms for a class of functions in the well-known Selberg class. The Tong-type identity and formula established in this paper can be viewed as an analogue of the well-known Voronois formula.
Let $e(s)$ be the error term of the hyperbolic circle problem, and denote by $e_alpha(s)$ the fractional integral to order $alpha$ of $e(s)$. We prove that for any small $alpha>0$ the asymptotic variance of $e_alpha(s)$ is finite, and given by an explicit expression. Moreover, we prove that $e_alpha(s)$ has a limiting distribution.
We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 geq p^theta$ for $theta=1/2+1/2000.$ This improves the work of Matomaki (2009) who obtained the result for $theta=1/2-varepsilon$ (with the added constraint that $d$ is also a prime), which improved the result of Baier and Zhao (2006) with $theta=4/9-varepsilon.$ Similarly as in the work of Matomaki, we apply Harmans sieve method to detect primes $p equiv 1 , (d^2)$. To break the $theta=1/2$ barrier we prove a new bilinear equidistribution estimate modulo smooth square moduli $d^2$ by using a similar argument as Zhang (2014) used to obtain equidistribution beyond the Bombieri-Vinogradov range for primes with respect to smooth moduli. To optimize the argument we incorporate technical refinements from the Polymath project (2014). Since the moduli are squares, the method produces complete exponential sums modulo squares of primes which are estimated using the results of Cochrane and Zheng (2000).
Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of representing $n$ as an ordered product of $j+r$ factors, of which the first $j$ must be non-trivial, and their natural extension to negative integers $r.$ We give recurrence properties and explicit formulae for these novel arithmetic functions. Specifically, the functions $c_j^{(-j)}(n)$ count, up to a sign, the number of ordered factorisations of $n$ into $j$ square-free non-trivial factors. These functions are related to a modified version of the Mobius function and turn out to play a central role in counting the number of sum systems of given dimensions. par Sum systems are finite collections of finite sets of non-negative integers, of prescribed cardinalities, such that their set sum generates consecutive integers without repetitions. Using a recently established bijection between sum systems and joint ordered factorisations of their component set cardinalities, we prove a formula expressing the number of different sum systems in terms of associated divisor functions.
Recent years have witnessed a controversy over Heisenbergs famous error-disturbance relation. Here we resolve the conflict by way of an analysis of the possible conceptualizations of measurement error and disturbance in quantum mechanics. We discuss two approaches to adapting the classic notion of root-mean-square error to quantum measurements. One is based on the concept of noise operator; its natural operational content is that of a mean deviation of the values of two observables measured jointly, and thus its applicability is limited to cases where such joint measurements are available. The second error measure quantifies the differences between two probability distributions obtained in separate runs of measurements and is of unrestricted applicability. We show that there are no nontrivial unconditional joint-measurement bounds for {em state-dependent} errors in the conceptual framework discussed here, while Heisenberg-type measurement uncertainty relations for {em state-independent} errors have been proven.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
