Mashreghi–Ransford inequality

From testwiki
Revision as of 09:41, 3 January 2023 by imported>Citation bot (Alter: number. Add: s2cid, doi. | Use this bot. Report bugs. | Suggested by SemperIocundus | #UCB_webform 436/2500)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In Mathematics, the Mashreghi–Ransford inequality is a bound on the growth rate of certain sequences. It is named after J. Mashreghi and T. Ransford.

Let (an)n0 be a sequence of complex numbers, and let

bn=k=0n(nk)ak,(n0),

and

cn=k=0n(1)k(nk)ak,(n0).

Here the binomial coefficients are defined by

(nk)=n!k!(nk)!.

Assume that, for some β>1, we have bn=O(βn) and cn=O(βn) as n. Then Mashreghi-Ransford showed that

an=O(αn), as n,

where α=β21. Moreover, there is a universal constant κ such that

(lim supn|an|αn)κ(lim supn|bn|βn)12(lim supn|cn|βn)12.

The precise value of κ is still unknown. However, it is known that

23κ2.

References