This article is available for purchase or by subscription. See below.
Abstract
|
We consider the upper bound of the Piltz divisor problem over number fields. The
Piltz divisor problem is known as a generalization of the Dirichlet divisor problem.
We deal with this problem over number fields and improve the error term of this
function for many cases. Our proof uses the estimate of exponential sums.
We also show uniform results for the ideal counting function and relatively
-prime
lattice points as one of its applications.
|
PDF Access Denied
We have not been able to recognize your IP address
3.138.34.158
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
ideal counting function, exponential sum, Piltz divisor
problem
|
Mathematical Subject Classification 2010
Primary: 11N45
Secondary: 11R42, 11H06, 11P21
|
Milestones
Received: 23 July 2018
Revised: 29 August 2018
Accepted: 31 December 2018
Published: 24 October 2019
|
|