Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the improvements of Hardy and Copson inequalities

Published 6 Sep 2022 in math.FA and math.CA | (2209.02612v2)

Abstract: In this current work, we revisit the recent improvement of the discrete Hardy's inequality in one dimension and establish an extended improved discrete Hardy's inequality with its optimality. We also study one-dimensional discrete Copson's inequality (E.T. Copson, \emph{Notes on a series of positive terms}, J. London Math. Soc., 2 (1927), 9-12.), and achieve an improvement of the same in a particular case. Further, we study some fundamental structures such as completeness, K\"{o}the-Toeplitz duality, separability, etc. of the sequence spaces which originated from the improved discrete Hardy and Copson inequalities in one dimension.

Authors (2)

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.