𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithmic proof of the polyhedral decomposition theorem

✍ Scribed by Mustafa Akgül

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
504 KB
Volume
35
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Entropy Proof of Bregman's Theorem
An Entropy Proof of Bregman's Theorem
✍ Jaikumar Radhakrishnan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Let A=(a i, j ) be an n\_n 0-1 matrix. Let S be the set of permutations \_ of [n] such that a i, \_(i) =1 for i=1, 2, ..., n. Then, the permanent of A is perm(A) = def |S|. For a pair of random variables (X, Y ) (with some joint distribution) and x # support[X ], let Y x be a random variable such t

Proof of the TCP Theorem
Proof of the TCP Theorem
✍ Gerhart Lüders 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 122 KB

A comparatively simple proof is given for the general theorem that a wide class of quantized field theories which are invariant under the proper Lorentz group is also invariant with respect to the product of time reversal (T), charge conjugation (C), and parity (P). In the proof use is made of an im