✦ LIBER ✦

Convex upper and lower bounds for present value functions

✍ Scribed by D. Vyncke; M. Goovaerts; J. Dhaene

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 153 KB
Volume: 17
Category: Article
ISSN: 1524-1904
DOI: 10.1002/asmb.437

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.

Improved upper and lower bounds for k-br

Improved upper and lower bounds for k-broadcasting

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

Upper and lower bounds for local electro

Upper and lower bounds for local electromagnetic quantities

✍ R. Albanese; R. Fresa 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 1 views

Most engineering problems are solved by means of numerical methods that are able to provide only approximate solutions, for which it would be extremely useful to have efficient error estimators. Upper and lower bounds for quantities of integral character, like the stored magnetic energy or the ohmi

Upper and Lower Bounds for Kazhdan–Luszt

Upper and Lower Bounds for Kazhdan–Lusztig Polynomials

✍ F. Brenti 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We give upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group W . If W is finite we prove that, for any k ≥ 0, the kth coefficient of the Kazhdan-Lusztig polynomial of two elements u, v of W is bounded from above by a polynomial (which depends only on k) in l(v)l(u). In par

New Upper and Lower Bounds for Ramsey Nu

New Upper and Lower Bounds for Ramsey Numbers

✍ Huang Yi Ru; Yang Jian Sheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Upper and Lower Bounds for Finite Bh[g]

Upper and Lower Bounds for Finite Bh[g] Sequences

✍ Javier Cilleruelo; Imre Z. Ruzsa; Carlos Trujillo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 113 KB

We give a non-trivial upper bound for F h ðg; NÞ, the size of a B h ½g subset of f1; . . . ; Ng, when g > 1. In particular, we prove F 2 ðg; NÞ41:864ðgNÞ 1=2 þ 1, and F h ðg; NÞ4 1 ð1þcos h ðp=hÞÞ 1=h ðhh!gNÞ 1=h , h > 2. On the other hand, we exhibit B 2 ½g subsets of f1; . . .