Research Scholars' Seminar Series
| Lecture Number: | 51 |
| Title: | Nets In Topology |
| Speaker: | Mr. Swarup Kumar Panda |
| Date: | 14th May 2013 (Tuesday) |
| Time: | 1600-1700 Abstarct: We have seen that in a topological space, sequences might not be adequate to check continuity of a function, accumulation points of a set and compactness of a set.In this talk I will give the de nition of net and its properties. Later I will show that nets are stronger than sequences. |
| Lecture Number: | 50 |
| Title: | Baire category theorem and applications |
| Speaker: | Mr. Nasim Akhtar |
| Date: | 26th March 2013 (Tuesday) |
| Time: | 1600-1700 |
Abstract: In this talk, I will give the statement and proof of the Baire category theorem for a metric space and give some applications of this theorem in different areas of mathematics.
| Lecture Number: | 49 |
| Title: | Singular Perturbation |
| Speaker: | Mr. Mohammad Hassan |
| Date: | 05th March 2013 (Tuesday) |
| Time: | 1600-1700 |
Abstract: In this talk, I will present the notion of singular perturbation and discuss about the classification of singular perturbation with various examples. Finally I will conclude the talk with the method of matched asymptotic expansion to solve singular perturbation problems.
| Lecture Number: | 48 |
| Title: | Euler's formula and Applications |
| Speaker: | Mr. S. Gowrisankar |
| Date: | 12th February 2013 (Tuesday) |
| Time: | 1600-1700 |
Abstract: In this talk among the many proofs of Euler's formula, we present a pretty and "self-dual" one that gets by without induction. Moreover we shall present some of its applications.
| Lecture Number: | 47 |
| Title: | Introduction to Bounds in Combinatorial Discrepancy |
| Speaker: | Mr. Himadri Nayak |
| Date: | 22nd January 2013 (Tuesday) |
| Time: | 1600-1700 |
Abstract: Let V = {v1, v2, ...vn} be any set and S = {s1, s2,...sm} be a collection of subsets of V. If we try to color the elements of V with two colors with the objective that for every set in S the difference between the number of elements colored with the two colors is made as possible then the question arises "how low can we make it ?". In fact the lower bound itself is a function of n.