Uniform approximation by polynomials with integer coefficients

DOI10.7494/OPMATH.2016.36.4.489zbMATH Open1339.41008MaRDI QIDQ2809655FDOQ2809655

Authors: Artur Lipnicki 

Publication date: 30 May 2016

Published in: Opuscula Mathematica (Search for Journal in Brave)

Recommendations

• On the lattice of polynomials with integer coefficients: the covering radius in \(L_p(0,1)\)
• Approximation of analytic functions by polynomials with integer coefficients
• scientific article; zbMATH DE number 4013215
• scientific article; zbMATH DE number 23209
• Chebyshev polynomials with integer coefficients

zbMATH Keywords

latticecovering radiusapproximation by polynomials with integer coefficients

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Approximation by polynomials (41A10)

Cites Work

• What Can Be Approximated by Polynomials with Integer Coefficients
• On the lattice of polynomials with integer coefficients: the covering radius in L_p(0,1)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• What Can Be Approximated by Polynomials with Integer Coefficients
• Uniform approximation by discrete least squares polynomials
• Intersective polynomials and Diophantine approximation. II
• Uniform approximation by polynomials in two functions
• Geometric properties of the lattice of polynomials with integer coefficients

This page was built for publication: Uniform approximation by polynomials with integer coefficients

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