An alternative proof of Di Perna'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

An Algebraic Proof of Barlet's Join Theo

An Algebraic Proof of Barlet's Join Theorem

✍ John Dalbec 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Another Proof of Gluck's Theorem

✍ Hiroshi Matsuyama 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 56 KB

In this article, G is a permutation group on a finite set . We write permutations on the right, so that αg is the image of α ∈ by the action of g ∈ G. A subset S of is said to be G-regular if the stabilizer g ∈ G Sg = S is the identity. Our purpose is to give a direct short proof of the following t

A Proof of Shirshov's Theorem

✍ Giuseppe Pirillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo

More proofs of menger's theorem

✍ C. St. J. A. Nash-Williams; W. T. Tutte 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph __G__ if it holds for the graphs obtained from __G__ by deleting and contracting the same edge. The other two prove the directed version of

A simple proof of Moser's theorem

✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.