✦ LIBER ✦

An upper bound for a valence of a face in a parallelohedral tiling

✍ Scribed by Magazinov, Alexander

Book ID: 120335060
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 364 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.02.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for a percolation constan

An upper bound for a percolation constant

✍ Dominic J. A. Welsh 📂 Article 📅 1965 🏛 Springer 🌐 English ⚖ 141 KB

An Upper Bound for the Probability of a

An Upper Bound for the Probability of a Union

✍ David Hunter 📂 Article 📅 1976 🏛 Applied Probability Trust 🌐 English ⚖ 569 KB

An upper bound for the diameter of a pol

An upper bound for the diameter of a polytope

✍ David Barnette 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d

An Upper Bound for cat E

✍ Hardie, K. A. 📂 Article 📅 1985 🏛 Oxford University Press 🌐 English ⚖ 49 KB

An upper and a lower bound for natural f

An upper and a lower bound for natural frequencies

✍ B.L. Ly 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 142 KB

An upper bound for the permanent of a no

An upper bound for the permanent of a nonnegative matrix

✍ Suk-Geun Hwang; Arnold R. Kräuter; T.S. Michael 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Let A be a fully indecomposable, nonnegative matrix of order n with row sums rt,..., ~;,, and let s~ equal the smallest positive element in row i of A. We prove the permanental inequality 11 II per(A) ~< 1-I s, + IX('"-s;) i::1 i::1 and characterize the case of equality. In 1984 Donald, Elwin, Hager