ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Rearrangement problem

Let F:R→RF:\mathbb{R}\to\mathbb{R} be an even convex function, then it is known (from Xi, Zhao (2022)) that for any function f,g∈L1(Rn)f,g\in L^1(\mathbb{R}^n) (for some n≥1n\geq 1), denoting f∗,g∗f^*,g^* the symmetrically decreasing rearrangement of f,gf,g, we have [\iint_{R^n\times\mathbb{R}^n}F(x\cdot y)f(x)g(y)dxdy\geq \iint_{R^n\times\mathbb{R}^n}F(x\cdot y)f^(x)g^(y)dxdy] However it is unclear whether the convexity constraint on FF is sharp. The two questions raised by Paul Simanjuntak are as follows:

  1. Can the hypothesis on FF be weakened ?

  2. Does this inequality extend to other settings, for instance Gaussian measures ?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.