Symmetrization inequalities on one-dimensional integer lattice

Abstract

In this paper, we develop a theory of symmetrization on the one dimensional integer lattice. More precisely, we associate a radially decreasing function u* with a function u 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 nα for 1 < α ≤ 2.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…