Prefer a chat interface with context about you and your work?
Chebyshev's Problem
The Chebyshev approximation problem is usually described as to find the polynomial (or the element of an Haar subspace) which uniformly best approximates a given continuous function. Most of the theoretical results forming the basis of this theory have not been explored by members of the St Petersburg Mathematical School, …