The sharp L1L^1 inequality for sup-convolution

Let CRkC\subset\mathbb{R}^k be a compact convex domain and let f:CRf:C\to\mathbb{R} be bounded and measurable. Write fnf^{\ast n} for the nn-fold sup-convolution of ff, let co(f)\operatorname{co}(f) denote its convex envelope, and let A(k,)A(k,\ell) be the Eulerian number counting permutations of SkS_k with \ell descents. Sharp L1L^1 inequality for sup-convolution. For arbitrary k,n1k,n\geq 1,

C(fn(x)f(x))dxck,nC(co(f)(x)f(x))dx,\int_C\bigl(f^{\ast n}(x)-f(x)\bigr)\,dx\geq c_{k,n}\int_C\bigl(\operatorname{co}(f)(x)-f(x)\bigr)\,dx,

where

ck,n=1nkm=1knmn(n+kmk)A(k,m1)=k+1nk+1(1k++(n1)k).c_{k,n}=\frac{1}{n^k}\sum_{m=1}^k\frac{n-m}{n}\binom{n+k-m}{k}A(k,m-1)=\frac{k+1}{n^{k+1}}\bigl(1^k+\ldots+(n-1)^k\bigr).

This conjecture extends the sharp inequality proved in the paper for the cases treated there; the general validity for arbitrary dimensions and convolution powers remains open.

Sources & referencesView supporting material

Primary source

Peter van Hintum, Hunter Spink and Marius Tiba, “Sharp L1 Inequalities for Sup-Convolution”, arXiv:2008.04606 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.