arXiv · 1402.1993
Linear programming over exponent pairs
Abstract
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the algorithm leads to the improvement and establishing new estimates in the various divisor problems in the analytic number theory.
Explore related subjects
Keep this discovery
Andrew V. Lelechenko. 2014-02-09. Linear programming over exponent pairs. https://doi.org/10.2478/ausi-2014-0014
Cite the original work for its findings. Save a collection to share your selection of sources.