Speaker : A Tulasi Ram Reddy
Date : 16th September, 2014 (Tuesday)
Time : 09:15 pm – 10:15 pm
Venue : Lecture Hall I, Department of Mathematics
Abstract: Probabilistic method is used in Combinatorics, Graph theory etc. Paul Erdos effectively used this non-constructive method in proving existence of objects having prescribed property. There are probabilistic proofs for theorems that we use frequently. In this talk I will work out some problems which can be done by this method. If time permits I shall present a proof of Shannon’s coding theorem.
PS: Only elementary calculus and counting arguments will be used.
Area: Probability Theory, Combinatorics