Rearrangement Inequalities on the Lattice Graph

Publication date: 14 December 2022

Abstract: The Polya-SzegH{o} inequality in

m a t h b b R^{n}

states that, given a non-negative function

f : m a t h b b R^{n} i g h t a r r o w m a t h b b R_{}

, its spherically symmetric decreasing rearrangement

f^{*} : m a t h b b R^{n} i g h t a r r o w m a t h b b R_{}

is `smoother' in the sense of

| a b l a f^{*} |_{L^{p}} l e q | a b l a f |_{L^{p}}

for all

1 l e q p l e q i n f t y

. We study analogues on the lattice grid graph

m a t h b b Z^{2}

. The spiral rearrangement is known to satisfy the Polya-SzegH{o} inequality for

p = 1

, the Wang-Wang rearrangement satisfies it for

p = i n f t y

and no rearrangement can satisfy it for

p = 2

. We develop a robust approach to show that both these rearrangements satisfy the Polya-SzegH{o} inequality up to a constant for all

1 l e q p l e q i n f t y

. In particular, the Wang-Wang rearrangement satisfies

| a b l a f^{*} |_{L^{p}} l e q 2^{1 / p} | a b l a f |_{L^{p}}

for all

1 l e q p l e q i n f t y

. We also show the existence of (many) rearrangements on

m a t h b b Z^{d}

such that

| a b l a f^{*} |_{L^{p}} l e q c_{d} c d o t | a b l a f |_{L^{p}}

for all

1 l e q p l e q i n f t y

.

This page was built for publication: Rearrangement Inequalities on the Lattice Graph