Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Discrete Dual pp-Hardy and Weighted Discrete pp- Birman Inequalities

Published 10 Sep 2026 in math.FA | (2609.11890v1)

Abstract: In this paper, we establish a new version of one dimensional generalized discrete dual pp-Hardy inequality with a shift. Using this generalized discrete dual p-Hardy inequality, we obtain improvements of two discrete dual pp-Hardy inequalities. To be specific, for $p&gt;1$ and ACc(N<em>0)A\in C_c(\mathbb{N}<em>{0}) satisfying A</em>0=A1=0A</em>{0}=A_{1}=0, we first improve the discrete dual p-Hardy inequality \begin{align*} &\displaystyle\sum_{n=2}{\infty}(n-1){p}| A_{n}-A_{n-1}|{p}\geq\frac{1}{p{p}}\displaystyle\sum_{n=2}{\infty}|A_{n}|{p}, \end{align*} where the associate constant term is sharp. Subsequently, we improve its power-type weighted discrete dual p-Hardy extension \begin{align*} &\displaystyle\sum_{n=2}{\infty}(n-1)α|A_{n}-A_{n-1}|{p}\geq\Big(\frac{α+1-p}{p}\Big){p} \displaystyle\sum_{n=2}{\infty}\frac{|A_{n}|{p}}{n{p-α}} \end{align*} for $p-1&lt;α\leq p$, where the associated constant term is also sharp. We also establish a discrete pp- Birman inequality with power weights. Furthermore, we establish a multivariable dual pp-Hardy inequality with a sharp constant. The proof proceeds by first establishing the inequality for two variables and then extending the argument to multiple variables, while preserving the sharpness of the constant.

Authors (1)

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.

Continue Learning

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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.