Let $\mathbb{B}^d$ be the closed unit ball in $\mathbb{R}^d$, $d\ge1$. We prove that, for every convex $f\in C(\mathbb{B}^d)$ and every integer $n\ge1$, there exists a polynomial $P_n$ of total degree at most $n$, convex on all of $\mathbb{R}^d$, such that $\|f-P_n\|_{C(\mathbb{B}^d)}\le c\,\omega_2(f,n^{-1};\mathbb{B}...
Andriy V. Bondarenko, A. Prymak, I. Shevchuk· 0 citations
Let $g_n$ be the largest number of Euclidean balls of diameter $1$ which may be needed to cover a set of diameter $1$ in $\mathbb{R}^n$. We study this problem for finite sets invariant under all coordinate permutations. We prove that the exponential growth rate in this symmetric problem can be characterized exactly as...
Andrii Arman, A. Bondarenko, A. Prymak et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.