Least multivariate Chebyshev polynomials on diagonally determined domains

We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval -1, 1. Let ^*ₙ be the subset of polynomials of degree at most n in d variables, whose homogeneous part of degree n has coefficients summing up to 1. The problem is determining a polynomial in ^*ₙ with the smallest uniform norm on a domain, which we call a least Chebyshev polynomial (associated with). Our main result solves the problem for belonging to a non-trivial class of domains, defined by a property of its diagonal, and establishes the remarkable result that a least Chebyshev polynomial can be given via the classical, univariate, Chebyshev polynomial. In particular, the solution can be independent of the dimension. The result is valid for fairly general domains that can be non-convex and highly irregular.