Rearrangement Inequalities on the Lattice Graph
Functional Analysis
2022-12-16 v1 Combinatorics
Abstract
The Polya-Szeg\H{o} inequality in states that, given a non-negative function , its spherically symmetric decreasing rearrangement is `smoother' in the sense of for all . We study analogues on the lattice grid graph . The spiral rearrangement is known to satisfy the Polya-Szeg\H{o} inequality for , the Wang-Wang rearrangement satisfies it for and no rearrangement can satisfy it for . We develop a robust approach to show that both these rearrangements satisfy the Polya-Szeg\H{o} inequality up to a constant for all . In particular, the Wang-Wang rearrangement satisfies for all . We also show the existence of (many) rearrangements on such that for all .
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}
}