✦ LIBER ✦

Eigenvalue extensions of Bohr’s inequality

✍ Scribed by Jagjit Singh Matharu; Mohammad Sal Moslehian; Jaspal Singh Aujla

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 189 KB
Volume: 435
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.01.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Variations and Generalizations of Bohr′s

Variations and Generalizations of Bohr′s Inequality

✍ J.E. Pecaric; T.M. Rassias 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Extensions of Steffensen's Inequality

✍ Peter R. Mercer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 56 KB

We offer a new proof of the well-known Steffensen Inequality, whose context is sufficiently general that it engenders a number of extensions.

Operator extensions of Hua’s inequality

✍ M.S. Moslehian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Orthogonal polynomials and extensions of

Orthogonal polynomials and extensions of Copson's inequality

✍ B.M. Brown; W.D. Evans; L.L. Littlejohn 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 857 KB

An Extension of Carlson's Inequality

✍ Kuang Jichang; Lokenath Debnath 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 64 KB

An extension of Carlson's inequality is made by using the Euler-Maclaurin summation formula. The integral analogues of this inequality are also presented.  2002 Elsevier Science (USA)

An extension of Janson's inequality

✍ Małgorzata Roos 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## An upper bound for P[W=O], where W is a sum of indicator variables with a special structure, which appears, for example, in subgraph counts in random graphs, is derived. Furthermore, its applications to a problem of k-runs and a random graph problem are given. The result is a generalization and