The smoothest average and some extremal problems for polynomials

Abstract

We study the problem of finding the "smoothest'' local average of a function f ∈ 2(Z) when we consider its convolution with suitable kernels u. The measurement of smoothness is as follows: Given a positive integer k, we aim to minimize the constant equation* 0 ≠ f ∈ 2(Z) \|∇k(u f)\|2(Z)\|f\|2(Z) equation* among all symmetric kernels u : \-n,…,n\ R with normalization Σj=-nnu(j) = 1. We are also interested in finding the kernel for which the least constant is attained. For k=1 and k=2, the sharp constants and optimal kernels were obtained by Kravitz-Steinerberger, and Richardson. In this paper, we provide alternative proofs for k∈ \1,2\ by using complex analysis tools. Moreover, we establish the case k=3, and also the cases k∈ \4,6\ when the kernels are restricted to have non-negative Fourier transform. These are the first results in the literature for k>2. Finally, we deduce a general relation between the sharp constants and optimal kernels corresponding to ∇k and ∇2k.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…