✦ LIBER ✦

Lower bounds on cube simplexity

✍ Scribed by Robert B. Hughes

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 856 KB
Volume: 133
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90020-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for the Simplexity of then

A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes

✍ Warren D. Smith 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Let T (n) denote the number of n-simplices in a minimum cardinality decomposition of the n-cube into n-simplices. For n ≥ 1, we show that T (n) ≥ H (n), where H (n) is the ratio of the hyperbolic volume of the ideal cube to the ideal regular simplex. Explicit bounds for T (n) are tabulated for n ≤

Lower bounds for the Chvátal–Gomory rank

Lower bounds for the Chvátal–Gomory rank in the 0/1 cube

✍ Sebastian Pokutta; Gautier Stauffer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Improved lower bounds on k-independence

✍ Yair Caro; Zsolt Tuza 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

## Abstract A vertex set __Y__ in a (hyper)graph is called __k__‐independent if in the sub(hyper)‐graph induced by __Y__ every vertex is incident to less than __k__ edges. We prove a lower bound for the maximum cardinality of a __k__‐independent set—in terms of degree sequences—which strengthens an

Lower bounds on multiple difference sets

✍ Wende Chen; Torleiv Kløve 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 568 KB

We give a lower bound on the maximal element in a multiple difference set.

Lower bounds on type checking overloadin

Lower bounds on type checking overloading

✍ Dennis M. Volpano 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 439 KB

Lower bounds on mt(r, s)

✍ A.C Mukhopadhyay 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 573 KB