2000 character limit reached
Symmetrization inequalities on one-dimensional integer lattice
Published 25 Apr 2022 in math.FA | (2204.11647v1)
Abstract: In this paper, we develop a theory of symmetrization on the one dimensional integer lattice. More precisely, we associate a radially decreasing function with a function defined on the integers and prove the corresponding Polya-Szeg\"{o} inequality. Along the way we also prove the weighted Polya-Szeg\"{o} inequality for the decreasing rearrangement on the half-line, i.e., non-negative integers. As a consequence, we prove the discrete weighted Hardy's inequality with the weight for $1 < \alpha \leq 2$.
Paper Prompts
Sign up for free to create and run prompts on this paper.