Linear programming over exponent pairs

DOI10.2478/AUSI-2014-0014MaRDI QIDQ4981721zbMATH OpenOpenAlexFDO

Authors A. V. Lelechenko

Publication date 24 June 2014

Published in Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://arxiv.org/abs/1402.1993

zbMATH Keywords

bounds for exponential sumsdivisors problemsexponent pairslinear programming

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Asymptotic results on arithmetic functions (11N37) Number-theoretic algorithms; complexity (11Y16) Linear programming (90C05)

Abstract: We consider the problem of the computation of $in{f}_{p}hetap$ over the set of exponent pairs $Pip$ under linear constraints for a certain class of objective functions $heta$. 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.

Recommendations

• An Algorithm for Computing Optimal Exponent Pairs
• scientific article; zbMATH DE number 169133
• On the divisor and circle problems
• scientific article; zbMATH DE number 4003901
• scientific article; zbMATH DE number 4017013

Cites work

• An Algorithm for Computing Optimal Exponent Pairs
• Computational geometry. Algorithms and applications.
• Exponential Sums and the Riemann Zeta Function
• Exponential sums and the Riemann zeta function v
• Exponential Sums and the Riemann Zeta-Function II
• scientific article; zbMATH DE number 4110793 (Why is no real title available?)
• scientific article; zbMATH DE number 41280 (Why is no real title available?)
• scientific article; zbMATH DE number 1994516 (Why is no real title available?)
• On an asymmetric divisor problem with congruence conditions
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(5)

• On the -exponential trajectory of linear programming
• A fourth derivative test for exponential sums
• An analog of van der Corput's A⁴-process for exponential sums
• Toward optimal exponent pairs
• Linearization method for a class of multiplicative programming with exponent

Describes a project that uses

Uses Software

• PARI/GP

This page was built for publication: Linear programming over exponent pairs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981721)