Linear programming over exponent pairs

Autor: Lelechenko, Andrew V.
Rok vydání: 2014
Předmět:
Zdroj: Acta Universitatis Sapientiae, Informatica, 2013, vol. 5, #2, p. 271-287
Druh dokumentu: Working Paper
DOI: 10.2478/ausi-2014-0014
Popis: 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.
Comment: 11 pages, 1 figure
Databáze: arXiv