✦ LIBER ✦

A lower bound on the size of molecules

✍ Scribed by Hugo R. Alarcón; Rafael D. Benguria

Publisher: Springer
Year: 1995
Tongue: English
Weight: 341 KB
Volume: 35
Category: Article
ISSN: 0377-9017
DOI: 10.1007/bf00761300

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds on the cluster size distrib

Lower bounds on the cluster size distribution

✍ Michael Aizenman; FranÇois Delyon; Bernard Souillard 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 595 KB

Lower bounds on the size of sweeping aut

Lower bounds on the size of sweeping automata

✍ Michael Sipser 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Bounds on the lower size of A 7-critical

Bounds on the lower size of A 7-critical graph

✍ Huanping Liu; Zhongfu Zhang; Dean Shen 📂 Article 📅 1994 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 307 KB

Tight Lower Bounds on the Size of Sweepi

Tight Lower Bounds on the Size of Sweeping Automata

✍ Hing Leung 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Lower bound on the size of weak bases in

Lower bound on the size of weak bases in lattices

✍ Z. Lengvárszky 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 97 KB

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.