2021
DOI: 10.48550/arxiv.2108.01500
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Discrete weighted Hardy Inequality in 1-D

Shubham Gupta

Abstract: In this paper we consider a weighted version of one dimensional discrete Hardy's Inequality on half-line with power weights of the form n α . Namely we consider:We prove the above inequality when α ∈ [0, 1) ∪ [5, ∞) with the sharp constant c(α). Furthermore when α ∈ [1/3, 1) we prove an improved version of (0.1) by adding infinitely many positive lower order terms on the RHS of inequality (0.1). More precisely we provefor non-negative constants b k (α).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 16 publications
(22 reference statements)
0
4
0
Order By: Relevance
“…In [21], the inequality was proved when α P p0, 1q. In a very recent paper [8], author proved (1.2) when α ą 5. The novelty of this paper is two fold.…”
Section: Introductionmentioning
confidence: 95%
See 2 more Smart Citations
“…In [21], the inequality was proved when α P p0, 1q. In a very recent paper [8], author proved (1.2) when α ą 5. The novelty of this paper is two fold.…”
Section: Introductionmentioning
confidence: 95%
“…We will prove inequality (1.2) with the sharp constant when α is an even natural number. This problem has been considered previously in the papers [21], [8]. To our surprise, this simple looking inequality hasn't been proved yet for all real numbers α.…”
Section: Introductionmentioning
confidence: 96%
See 1 more Smart Citation
“…In the last section 5, we apply the weighted Polya-Szegö inequality proved in section 2 to prove discrete Hardy's inequality on non-negative integers with weights n α for 1 < α ≤ 2, refer [10] and [11] for the proof of this inequality for α ∈ [0, 1) ∪ [5, ∞) and α ∈ 2N respectively.…”
Section: Introductionmentioning
confidence: 99%