Uniform bounds of the Piltz divisor problem over number fields
From MaRDI portal
(Redirected from Publication:2305355)
Abstract: We consider the upper bound of Piltz divisor problem over number fields. 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 ideal counting function and relatively -prime lattice points as one of applications.
Recommendations
- Correction to: ``Uniform bounds of the Piltz divisor problem over number fields
- Piltz divisor problem over number fields à la Voronoï
- Explicit bound of the divisor function
- On the Piltz divisor problem in algebraic number fields
- The Piltz divisor problem in number fields: An improved lower bound by Soundararajan's method
Cites work
- A DIVISOR PROBLEM
- Estimates of lattice points in the discriminant aspect over abelian extension fields
- scientific article; zbMATH DE number 3199818 (Why is no real title available?)
- On the average number of unitary factors of finite abelian groups
- On the distribution of ideals in cubic number fields
- On the Distribution of Integer Ideals in Algebraic Number Fields
- On the distribution of integral ideals and Hecke Grössencharacters
- On the ideal theorem for number fields
- On the Phragmén-Lindelöf theorem and some applications
- The Piltz divisor problem in number fields: An improved lower bound by Soundararajan's method
- The probability that random algebraic integers are relatively r-prime
- Visible lattice points and the extended Lindelöf hypothesis
Cited in
(5)
This page was built for publication: Uniform bounds of the Piltz divisor problem over number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305355)