Rearrangement Inequalities on the Lattice Graph
Shubham Gupta, Stefan Steinerberger

TL;DR
This paper investigates rearrangement inequalities on the lattice graph ^2, extending classical Polya-Szeg53 inequalities to discrete settings and establishing bounds for various rearrangements across all p-norms.
Contribution
It develops a robust method to show that certain lattice rearrangements satisfy Polya-Szeg53 inequalities up to a constant for all p, generalizing previous results.
Findings
Wang-Wang rearrangement satisfies abla f^*_{L^p} q; 2^{1/p} \u00a0 abla f_{L^p} for all p.
Existence of multiple rearrangements on ^d with bounded abla f^*_{L^p} norms.
Extension of inequalities to all p in [1, ] with explicit bounds.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCrystallography and molecular interactions · Crystal structures of chemical compounds · Molecular Sensors and Ion Detection
