English

Rearrangement Inequalities on the Lattice Graph

Functional Analysis 2022-12-16 v1 Combinatorics

Abstract

The Polya-Szeg\H{o} inequality in Rn\mathbb{R}^n states that, given a non-negative function f:RnRf:\mathbb{R}^{n} \rightarrow \mathbb{R}_{}, its spherically symmetric decreasing rearrangement f:RnRf^*:\mathbb{R}^{n} \rightarrow \mathbb{R}_{} is `smoother' in the sense of fLpfLp\| \nabla f^*\|_{L^p} \leq \| \nabla f\|_{L^p} for all 1p1 \leq p \leq \infty. We study analogues on the lattice grid graph Z2\mathbb{Z}^2. The spiral rearrangement is known to satisfy the Polya-Szeg\H{o} inequality for p=1p=1, the Wang-Wang rearrangement satisfies it for p=p=\infty and no rearrangement can satisfy it for p=2p=2. We develop a robust approach to show that both these rearrangements satisfy the Polya-Szeg\H{o} inequality up to a constant for all 1p1 \leq p \leq \infty. In particular, the Wang-Wang rearrangement satisfies fLp21/pfLp\| \nabla f^*\|_{L^p} \leq 2^{1/p} \| \nabla f\|_{L^p} for all 1p1 \leq p \leq \infty. We also show the existence of (many) rearrangements on Zd\mathbb{Z}^d such that fLpcdfLp\| \nabla f^*\|_{L^p} \leq c_d \cdot \| \nabla f\|_{L^p} for all 1p1 \leq p \leq \infty.

Keywords

Cite

@article{arxiv.2212.07590,
  title  = {Rearrangement Inequalities on the Lattice Graph},
  author = {Shubham Gupta and Stefan Steinerberger},
  journal= {arXiv preprint arXiv:2212.07590},
  year   = {2022}
}