𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Assuring a global optimum by the use of an upper bound on the lower (dual) bound

✍ Scribed by Arthur W. Westerberg; Jigar V. Shah

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
702 KB
Volume
2
Category
Article
ISSN
0098-1354

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound on the size of a complex g
A lower bound on the size of a complex generated by an antichain
✍ P. Frankl πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 427 KB

A short proof of the following result of Kleitman is given: the total number of sets contained in some member of an antichain of size (i) over the n-set is at least (E) + l --+ (i) for 0 < k G in. An equally short proof of Harper's isoperimetric theorem is provided as well.

Upper and lower bounds on the drag coeff
Upper and lower bounds on the drag coefficient of a sphere in an Ellis model fluid
✍ Scott W. Hopke; John C. Slattery πŸ“‚ Article πŸ“… 1970 πŸ› American Institute of Chemical Engineers 🌐 English βš– 562 KB

Hill's extremum principles are not directly applicable to an Ellis model fluid. A method of adapting Hill's principles to the Ellis model was developed and used to calculate upper and lower bounds on the drag coefficient for a sphere moving slowly through such a fluid. Amilable experimental data wer

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. TietΓ€vΓ€inen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole Β΄ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta Β¨ va Β¨ inen's bound .