ترغب بنشر مسار تعليمي؟ اضغط هنا

On the convolution inequality $f geq fstar f$

167   0   0.0 ( 0 )
 نشر من قبل Eric Carlen
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We consider the inequality $f geqslant fstar f$ for real integrable functions on $d$ dimensional Euclidean space where $fstar f$ denotes the convolution of $f$ with itself. We show that all such functions $f$ are non-negative, which is not the case for the same inequality in $L^p$ for any $1 < p leqslant 2$, for which the convolution is defined. We also show that all integrable solutions $f$ satisfy $int f(x){rm d}x leqslant tfrac12$. Moreover, if $int f(x){rm d}x = tfrac12$, then $f$ must decay fairly slowly: $int |x| f(x){rm d}x = infty$, and this is sharp since for all $r< 1$, there are solutions with $int f(x){rm d}x = tfrac12$ and $int |x|^r f(x){rm d}x <infty$. However, if $int f(x){rm d}x = : a < tfrac12$, the decay at infinity can be much more rapid: we show that for all $a<tfrac12$, there are solutions such that for some $epsilon>0$, $int e^{epsilon|x|}f(x){rm d}x < infty$.



قيم البحث

اقرأ أيضاً

131 - Egor Kosov 2020
The paper studies the sampling discretization problem for integral norms on subspaces of $L^p(mu)$. Several close to optimal results are obtained on subspaces for which certain Nikolskii-type inequality is valid. The problem of norms discretization i s connected with the probabilistic question about the approximation with high probability of marginals of a high dimensional random vector by sampling. As a byproduct of our approach we refine the result of O. Gu$acute{e}$don and M. Rudelson concerning the approximation of marginals. In particular, the obtained improvement recovers a theorem of J. Bourgain, J. Lindenstrauss, and V. Milman concerning embeddings of finite dimensional subspaces of $L^p[0, 1]$ into $ell_p^m$. The proofs in the paper use the recent developments of the chaining technique by R. van Handel.
In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=F_{q}+vF_{q}+v^{2}F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construct ion of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $F_q$ and extend these to codes over $R$.
59 - Kevin ONeill 2018
One may define a trilinear convolution form on the sphere involving two functions on the sphere and a monotonic function on the interval $[-1,1]$. A symmetrization inequality of Baernstein and Taylor states that this form is maximized when the two fu nctions on the sphere are replaced with their nondecreasing symmetric rearrangements. In the case of indicator functions, we show that under natural hypotheses, the symmetric rearrangements are the only maximizers up to symmetry by establishing a sharpened inequality.
A review of the new of the problem of dark energy using modified gravity approach is considered. An explanation of the difficulties facing modern cosmology is given and different approaches are presented. We show why some models of gravity may suffer of instabilities and how some are inconsistent with observations.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا