Two Integral Sliding-Window Inequalities for Maximal Convolutions

Abstract

We prove two sliding-window inequalities for maximal convolutions. The first concerns the multiplicative maximal convolution. If f and g are nonnegative continuous functions on [0,A] and [0,B], respectively, define \[ h(x)=0 u A\\0 x-u B f(u)g(x-u), 0 x A+B. \] Then there exists a window [a,a+B] of length B such that \[ 1B∫aa+Bh(x)\,dx (1A∫0A f(x)\,dx) (1B∫0B g(x)\,dx). \] The second concerns the additive maximal convolution. Let f and g be nonnegative continuous functions on [0,C], and define \[ H(x)=0 u C\\0 x-u C\f(u)+g(x-u)\, 0 x 2C. \] Then, for every p1, there exists a window [a,a+C] of length C such that \[ (∫aa+CH(x)p\,dx)1/p (∫0C f(x)p\,dx)1/p + (∫0C g(x)p\,dx)1/p. \] We also record discrete analogues. The main point is that, in one-dimensional maximal-convolution settings, certain global Brunn--Minkowski or Prékopa--Leindler type phenomena admit natural sliding-window localizations.

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…