Papers
Topics
Authors
Recent
Search
2000 character limit reached

The $p$-Hardy-Rellich-Birman inequalities on the half-line

Published 9 Mar 2026 in math.CA | (2603.08864v1)

Abstract: The classical discrete $p$-Hardy inequality establishes a sharp relationship between the $\ell{p}$-norms of a sequence and its discrete derivative. In this paper, we generalize this inequality to discrete derivatives of arbitrary integer order $\ell \geq 1$, yielding discrete $p$-Rellich ($\ell=2$) and general $p$-Birman ($\ell \geq 3$) inequalities. As a key step in the proof, we deduce a variant of the Copson inequality with a negative exponent, which may be of independent interest. Furthermore, we demonstrate how the continuous $p$-Birman inequality can be recovered from our discrete version, providing an alternative proof of this classical result. All constants in the obtained inequalities are shown to be optimal.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.