๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some applications of Jensen's coding theorem

โœ Scribed by R. David

Publisher
Elsevier Science
Year
1982
Weight
1015 KB
Volume
22
Category
Article
ISSN
0003-4843

No coin nor oath required. For personal study only.

โœฆ Synopsis

R~ceived 8 April 1980 * After we have written this paper, R, Jcasen tells us that A. Belier has proved--independently and l~ffOre---lhe q~eorem I by similar meth(~s h~ his unpublished thesis.

๐Ÿ“œ SIMILAR VOLUMES

On Some Refinements of Jensen's Inequali
On Some Refinements of Jensen's Inequality
โœ Mohammad Kazim Khan; Muhammad Hanif ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

This paper contains a link between Probability Proportional to Size (PPS) sampling and interpolations of the classical Jensen inequality. We show that these interpolating inequalities are, in fact, special cases of the conditional Jensen inequality when applied over an appropriate probability space.

Some applications of Vizing's theorem to
Some applications of Vizing's theorem to vertex colorings of graphs
โœ Henry A. Kierstead; James H. Schmerl ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 812 KB

In this paper we shall study the relationships between the following three families of assertions: C(n): If G is a graph that does not induce & or KS-e and w(G) 6 n. then x(G)rn+l. C'(n): If M is a multigraph such that A(M)< n, p(M)<2 and M does not contain a S-sided triangle (i.e., a triangle with