Linear programming over exponent pairs

oleh: Lelechenko Andrew V.

Format: Article
Diterbitkan: Scientia Publishing House 2013-12-01

Deskripsi

We consider the problem of the computation of infp θp over the set of exponent pairs P ∋ p under linear constrains for a certain class of objective functions θ. 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 analytical number theory.