2000 character limit reached
One-dimensional discrete Hardy and Rellich inequalities on integers
Published 21 Dec 2021 in math.FA | (2112.10923v2)
Abstract: In this paper, we consider a weighted version of one-dimensional discrete Hardy inequalities with power weights of the form . We prove the inequality when is an even natural number with the sharp constant and remainder terms. We also find explicit constants in standard and weighted Rellich inequalities and its higher order versions. As a by-product of this work we derive a combinatorial identity using purely analytic methods. This suggests a correlation between combinatorial identities and functional identities.
Paper Prompts
Sign up for free to create and run prompts on this paper.