Have a personal or library account? Click to login
Linear programming over exponent pairs Cover
Open Access
|May 2014

Abstract

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.

Language: English
Page range: 271 - 287
Submitted on: Aug 28, 2013
|
Published on: May 30, 2014
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2014 Andrew V. Lelechenko, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.