Abstract:
We investigate the weighted Bojanov–Chebyshev extremal problem for trigonometric polynomials, that is,
the minimax problem of minimizing $\|T\|_{w,C(\mathbb{T})}$,
where $w$ is a sufficiently nonvanishing, upper bounded, nonnegative weight function,
the norm is the corresponding weighted maximum norm on the torus $\mathbb{T}$, and $T$ is a trigonometric polynomial
with prescribed multiplicities $\nu_1,\ldots,\nu_n$ of root factors $|\sin(\pi(t-z_j))|^{\nu_j}$.
If the $\nu_j$ are natural numbers and their sum is even,
then $T$ is indeed a trigonometric polynomial
and
the case when all the $\nu_j$ are 1 covers the Chebyshev extremal problem.
Our result will be
more general, allowing, in particular,
so-called generalized trigonometric polynomials.
To reach our goal, we invoke Fenton's
sum of translates method.
However, altering from the earlier described cases without weight or on the interval,
here we find different situations, and can state less about the solutions.
Keywords:minimax and maximin problems, kernel function,
sum of translates function, vector of local maxima,
equioscillation, majorization.
Funding agency
Grant number
Hungarian National Research, Development and Innovation Fund
TKP2021-NVA-09 K-132097
This research of Béla Nagy was supported by project TKP2021-NVA-09. Project no. TKP2021-NVA-09
has been implemented with the support provided by the Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund, financed under the TKP2021-NVA funding scheme. The work of Sz. Gy. Révész was supported in part by Hungarian National Research, Development and Innovation Fund project # K-132097.
Citation:
B. Nagy, Sz. Gy. Révész, “On the weighted trigonometric Bojanov–Chebyshev extremal problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 29, no. 4, 2023, 193–216