✦ LIBER ✦

Conjectures about the evolution of the moon

✍ Scribed by T. Gold

Publisher: Springer Netherlands
Year: 1973
Tongue: English
Weight: 1003 KB
Volume: 7
Category: Article
ISSN: 1573-0794
DOI: 10.1007/bf00564636

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

About the Collatz conjecture

✍ Ştefan Andrei; Cristian Masalagiu 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 115 KB

Confirming Two Conjectures About the Int

Confirming Two Conjectures About the Integer Partitions

✍ Boris Pittel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 127 KB

For a given integer n, let 4 n denote the set of all integer partitions \* 1 \* 2 } } } \* m >0 (m 1), of n. For the dominance order ``P'' on 4 n , we show that if two partitions \*, + are both chosen from 4 n uniformly at random, and independent of each other, then Pr(\*P +) Ä 0 as n Ä . This state

Two conjectures about the issue of exper

Two conjectures about the issue of expert testimony

✍ Gordon Bermant 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 314 KB

Comparison conjectures about the M/G/s q

Comparison conjectures about the M/G/s queue

✍ Ward Whitt 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 769 KB

Revision of conjectures about the oppone

Revision of conjectures about the opponent’s utilities in signaling games

✍ Tim Schulteis; Andres Perea; Hans Peters; Dries Vermeulen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 156 KB

On a conjecture about the hypoenergetic

On a conjecture about the hypoenergetic trees

✍ Jianping Liu; Bolian Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 308 KB

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n-vertex graph G is said to be hypoenergetic if E(G) < n. In Gutman et al. (2008) [14] the authors conjectured that there exist n-vertex hypoenergetic trees with maximum degree ∆ = 4 for any n ≡ 2 mod 4, n > 2