Linear programming over exponent pairs

DOI10.2478/ausi-2014-0014zbMath1377.11127arXiv1402.1993OpenAlexW2060601688MaRDI QIDQ4981721

A. V. Lelechenko

Publication date: 24 June 2014

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

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

zbMATH Keywords

linear programmingexponent pairsbounds for exponential sumsdivisors problems

Mathematics Subject Classification ID

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

Uses Software

• PARI/GP

Cites Work

• On an asymmetric divisor problem with congruence conditions
• Exponential Sums and the Riemann Zeta Function
• Exponential Sums and the Riemann Zeta-Function II
• Exponential sums and the Riemann zeta function v
• An Algorithm for Computing Optimal Exponent Pairs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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