Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem

DOI10.1080/10586458.2019.1691089MaRDI QIDQ5094504zbMATH OpenOpenAlexWikidataFDO

Authors Kevin G. Hare, Philip W. Hodges

Publication date 3 August 2022

Published in Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

integer Chebyshev problemsemi-infinite programing

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials and rational functions of one complex variable (30C10) Approximation in the complex plane (30E10) Semi-infinite programming (90C34)

Abstract: We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to improve on previous methods for finding integer Chebyshev polynomials of degree $n$. Using our new method, we found 16 new integer Chebyshev polynomials of degrees in the range 147 to 244.

Recommendations

• scientific article; zbMATH DE number 4048903
• The multivariate integer Chebyshev problem
• Numerical experiments in semi-infinite programming
• Integer sequences and semidefinite programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• An application of integer programming to the decomposition of numerical semigroups
• Semidefinite programming and integer programming
• On Linear Semi-Infinite Programming Problems: An Algorithm
• The almost chebyshev property in linear semi-infinite programming
• The integer Chebyshev problem

Cites work

• A new exceptional polynomial for the integer transfinite diameter of \([0,1]\)
• Computational excursions in analysis and number theory
• Consequences of the continuity of the monic integer transfinite diameter
• Generalized Gorshkov-Wirsing polynomials and the integer Chebyshev problem
• scientific article; zbMATH DE number 699709 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• scientific article; zbMATH DE number 1461213 (Why is no real title available?)
• Integer transfinite diameter and polynomials with small Mahler measure
• Monic integer Chebyshev problem
• On integer Chebyshev polynomials
• On the absolute length of polynomials having all zeros in a sector
• Polynomials with integer coefficients and their zeros
• Small polynomials with integer coefficients
• The integer Chebyshev constant of Farey intervals
• The integer Chebyshev problem
• The integer transfinite diameter of intervals and totally real algebraic integers
• The monic integer transfinite diameter
• The multivariate integer Chebyshev problem
• Trace of totally positive algebraic integers and integer transfinite diameter

Cited in

(2)

• Chebyshev polynomials with integer coefficients
• Generalized Gorshkov-Wirsing polynomials and the integer Chebyshev problem

This page was built for publication: Applications of Integer Semi-Infinite Programing to the Integer Chebyshev Problem

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