In this article, we prove an asymptotic formula for the mean value of long smoothed Dirichlet polynomials with divisor coefficients. Our result has a main term that includes all lower order terms and a power saving error term. This is derived from a more general theorem on mean values of long smoothed Dirichlet polynomials that was previously established by the second and third authors. We thus establish a stronger form of a conjecture of Conrey and Gonek in the case of divisor functions.
In this article, we prove an asymptotic formula for mean values of long Dirichlet polynomials with higher order shifted divisor functions, assuming a smoothed additive divisor conjecture for higher order shifted divisor functions. As a consequence of this work, we prove special cases of conjectures of Conrey-Keating on mean values of long Dirichlet polynomials with higher order shifted divisor functions as coefficients.
We present several new results involving $Δ(x+U)-Δ(x)$, where $U = o(x)$ and $$ Δ(x):=\sum_{n\le x}d(n)-x\log x-(2γ-1)x $$ is the error term in the classical Dirichlet divisor problem.
Several results are obtained concerning the function $Δ_k(x)$, which represents the error term in the general Dirichlet divisor problem. These include the estimates for the integral of this function, as well as for the corresponding mean square integral. The mean square integral of $Δ_2(x)$ is investigated in detail.
We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N α\le x} \mathfrak{t}_k(α)$, where $N$ stands for the norm of a complex number and $\mathfrak{t}_k$ is the $k$-dimensional divisor function on Gaussian integers.
Let $d(n)$ be the number of divisors of $n$, let $$ Δ(x) := \sum_{n\le x}d(n) - x(\log x + 2γ-1) $$ denote the error term in the classical Dirichlet divisor problem, and let $ζ(s)$ denote the Riemann zeta-function. Several upper bounds for integrals of the type $$ \int_0^TΔ^k(t)|ζ(1/2+it)|^{2m}dt \qquad(k,m\in\Bbb N) $$ are given. This complements the results of the paper Ivić-Zhai [Indag. Math. 2015], where asymptotic formulas for $2\le k \le 8,m =1$ were established for the above integral.
In this article, we study the Piltz divisor problem, which is sometimes called the generalized Dirichlet divisor problem, over number fields. We establish an identity akin to Voronoï's formula concerning the error term in the Dirichlet divisor problem.
For functions defined via Dirichlet/generalized Dirichlet series in some half planes of the complex plane, we give a new simple elementary approach to obtain an Approximate Functional Equation(AFE for short) for the product of functions with explicit remainder term. We do this,using a highly generalized identity following Motohashi's approach,wherein he uses a generalisation of Dirichlet's device.We use our method to give an AFE for the product of two Dirichlet L-series corresponding to primitive Dirichlet characters with hitherto unknown estimate for its remainder term.We also consideer AFEs …
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper is concerned with the precise input of the conjectural formula for the classical shifted convolution problem for divisor sums so as to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^2$ with divisor functions as coefficients.
We prove that $$ \int_1^XΔ(x)Δ_3(x)\,dx \ll X^{13/9}\log^{10/3}X, \quad \int_1^XΔ(x)Δ_4(x)\,dx \ll_\varepsilon X^{25/16+\varepsilon}, $$ where $Δ_k(x)$ is the error term in the asymptotic formula for the summatory function of $d_k(n)$, generated by $ζ^k(s)$ ($Δ_2(x) \equiv Δ(x)$). These bounds are sharper than the ones which follow by the Cauchy-Schwarz inequality and mean square results for $Δ_k(x)$. We also obtain the analogues of the above bounds when $\D(x)$ is replaced by $E(x)$, the error term in the mean square formula for $|ζ(1/2+it)|$.
In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive prime divisors and representations of some related Euler products. Moreover, we sum functions over all primitive divisors of a Fibonacci number and obtain a non--trivial fixed point of this operation.
In this series we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper begins the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of length up to $T^3$ with divisor functions as coefficients.
We have developed a heuristic showing that in the Dirichlet divisor problem for the almost all $n \in \mathbb{N}^{+}$: $$ R(n) \leq O(ψ(n)n^{\frac{1}{4}}) $$ where $$ R(n) = \Big\lvert \sum_{x=1}^{n}\Big\lfloor\frac{n}{x}\Big\rfloor - n\log{n} - (2γ-1)n \Big\rvert $$ and $ ψ(n) $ - any positive function that increases unboundedly as $ n \to \infty $. The result is achieved under the hypothesis: $$ \Big \{\frac{n}{x} \Big \} \sim w_x $$ where $ w_x $ is uniformly distributed over $ [0,1) $ random variable with a values set $ \{0, \frac {1} {x}, \ldots, \frac{x-1}{x} \} $ and the value accepting…
In this series of papers we examine the calculation of the $2k$th moment and shifted moments of the Riemann zeta-function on the critical line using long Dirichlet polynomials and divisor correlations. The present paper completes the general study of what we call Type II sums which utilize a circle method framework and a convolution of shifted convolution sums to obtain all of the lower order terms in the asymptotic formula for the mean square along $[T,2T]$ of a Dirichlet polynomial of arbitrary length with divisor functions as coefficients.
In this rather computational paper, we determine certain representation numbers of ideals in real quadratic number fields explicitly in order to obtain a representation of the associated Dirichlet series in terms of Dirichlet L-functions and a generalized divisor sum. A direct and important consequence is that the Dirichlet series has a meromorphic continuation to the whole complex plane and a simple pole at $s=2$ whose residue can be made explicit in terms of the Dirichlet L-functions and the generalized divisor sum.
We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.
The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime divisors of some single polynomial. By combining this result with a theorem of Ax we get that for any system $F$ of multivariate polynomial equations with integer coefficients, the set of primes $p$ for which $F$ is solvable modulo $p$ is the set of prime divisors of some univariate polynomial. In addition, we prove results on the densities of the prime divisors of…
A representation of SL(2,Z) by integer matrices acting on the space of analytic ordinary Dirichlet series is constructed, in which the standard unipotent element acts as multiplication by the Riemann zeta function. It is then shown that the Dirichlet series in the orbit of the zeta function are related to it by algebraic equations.
We examine an elliptic curve constructed in an earlier paper from a certain representation of $\SL(2,\Z)$ on the space of convergent Dirichlet series. The curve is observed to be a modular curve for $Γ^1(15)$ and a certain orbit of modular functions is thereby associated with the Riemann zeta function. Explicit descriptions are given of these functions and of the permutation action of $\SL(2,\Z)$ on them.
In this paper, we obtain analogues of Zsigmondy's theorem and the primitive divisor results for the Lucas and Lehmer sequences in polynomial rings of several variables.
The effectivity up to R-linear equivalence (Dirichlet property) of pseudoeffective adelic R-Cartier divisors is a subtle problem in arithmetic geometry. In this article, we propose sufficient conditions for the Dirichlet property by using the dynamic system in the classic Arakelov geometry setting. We also give a numerical criterion of the Dirichlet property for adelic R-Cartier divisors on curves over a trivially valued field.
Let $\mathcal{A}$ and $\mathcal{B}$ be sets of polynomials of degree $n$ over a finite field. We show, that if $\mathcal{A}$ and $\mathcal{B}$ are large enough, then $A+B$ has an irreducible divisor of large degree for some $A\in\mathcal{A}$ and $B\in \mathcal{B}$.
Given a polynomial $ϕ$ over a global function field $K$ and a wandering base point $b\in K$, we give a geometric condition on $ϕ$ ensuring the existence of primitive prime divisors for almost all points in the orbit $\mathcal{O}_ϕ(b):=\{ϕ^n(b)\}_{n\geq0}$
We explore some intersection properties of divisors associated to polarized dynamical systems on algebraic surfaces. As a consequence, we obtain necessary geometric conditions for the existence of polarizations of hyperbolic type and exhibit compactified divisors associated to automorphisms on K3 surfaces that do not have the Dirichlet property as defined by Moriwaki.
This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We extend the Selberg-Delange method to handle the following problems.\;The number of monic polynomials with degree $n$ have $t$ irreducible factors;\;The number of monic polynomials with degree $n$ in some residue classes have $t$ irreducible factors and the residue classes distribution of divisors of monic polynomial.\;
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than $m$. To that end, we first derive an improved estimate for the proportion of polynomials of degree $n$, all of whose non-constant divisors have degree greater than $m$. In the limit as $q \to \infty$, these results coincide with corresponding estimates related to the c…
For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong result for the function field analogue of a classical problem in number theory.
We give an asymptotic formula for the divisor sum $\sum_{c<n\leq N}τ\left((n-b)(n-c)\right)$ for integers $b<c$ of the same parity. Interestingly, the coefficient of the main term does not depend on the discriminant as long as it is a full square. We also provide effective upper bounds of the average divisor sum for some of the reducible quadratic polynomials considered before, with the same main term as in the asymptotic formula.
In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers and Soundararajan, we do not require averaging over the moduli. Our proof adapts a technique of S. Lester who treated in the same range the variance of the k-fold divisor function in the short intervals setting, and is based on a smoothed Voronoi summation formula but twisted by multiplicative characters. The use of Dirichlet characters allows us to extend …
Consider the divisor sum $\sum_{n\leq N}τ(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve the maximal possible number of $D(-1)$-quadruples.
We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1 and c_2 such that $$c_1 x/(log x) \leq F(x) \leq c_2 x/(log x).$$
We characterize all monic polynomials $f(x) \in \mathbb{Z}[x]$ that have the property that \[f(p) \mid f(p^{p}),~\text{for all sufficiently large primes }p \geq N(f). \] We also give necessary conditions and a sufficient condition for monic polynomials $f(x) \in \mathbb{Z}[x]$ to satisfy $f(p) \mid f(p^{p})$ for all primes $p$.
Motivated by a question of Venkataramana, we consider the greatest common divisor of $ϕ(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we establish that this gcd may be bounded just in terms of the degree of the polynomial $f$. Unconditionally we establish such a bound for quadratic polynomials, as well as polynomials that split completely into linear factors. The paper also addresses a question of Calegari, and establishes that there are infinitely many $n$ such that $n^2+1$ is not divisible by any…
The only (unitary) perfect polynomials over $\mathbb{F}_2$ that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$. Other consequences of such a factorization are new results about odd perfect polynomials.
We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $σ(A)/A $ is still a binary polynomial. Technically, we prove that the only (unitary) perfect polynomials over $\F_2$ that are products of $x$, $x+1$ and of Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$.
In a recent paper, Lapkova uses a Tauberian theorem to derive the asymptotic formula for the divisor sum $\sum_{n \leq x} d( n (n+v))$ where $v$ is a fixed integer and $d(n)$ denotes the number of divisors of $n$. We reprove her result by following a suggestion of Hooley, namely investigating the relationship between this sum and the well-known sum $\sum_{n \leq x} d( n ) d (n+v)$. As such, we are able to furnish additional terms in the asymptotic formula.
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too sparse, and we use it to compute the logarithm of the maximum of the divisor function at every degree up to an error of a constant, which is significantly smaller than in the case of the integers, even assuming the Riemann Hypothesis.
Consider the divisor sum $\sum_{n\leq N}τ(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main term. As an application we give an improvement of the maximal possible number of $D(-1)$-quadruples.
We consider the asymptotic behavior of the mean square of truncations of the Dirichlet series of $ζ(s)^k$. We discuss the connections of this problem with that of the variance of the divisor function in short intervals and in arithmetic progressions, reviewing the recent results on this topic. Finally, we show how these results can all be proved assuming a suitable version of the moments conjecture.
Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We determine the order of magnitude of $H_F(x, y, z)$ uniformly for $y+y/\log^C y < z\le y^2$ and $y\le x^{1-δ}$, showing that the order is the same as the order of $H(x,y,z)$, the number of positive integers $n\le x$ with a divisor in $(y,z]$. Here $C$ is an arbitrarily large constant and $δ>0$ is arbitrarily small.
