|
|
||||||||||||||||||||
|
Analysis seminar
Speaker: Prof. S. Thangavelu
Host: Sanjoy Pusti
Title: On Hardy's inequality for fractional powers of the sublaplacian
Time, day and date: 4:00:00 PM – 5:15:00 PM, Friday, November 07
Venue: Ramanujan Hall
Abstract: In these lectures we plan to give an introduction to Hardy's inequality for fractional powers of the sublaplacian on the Heisenberg group. We will recall the case of the standard Laplacian on $ \R^n $ and give a proof of Hardy's inequality for $ (-Delta)^s $ using extension problem and trace Hardy inequality. We will then develop necessary background for studying the modified extension problem for the sublaplacian, establish an analogue of trace Hardy inequality and deduce Hardy's inequality.
Student Seminar
Speaker: Om Milind Joglekar, IIT Bombay
Host: Suman Kumar Sahoo
Title: Classification of Moore graphs
Time, day and date: 5:30:00 PM – 6:30:00 PM, Friday, November 07
Venue: Room 215
Abstract: Moore graphs are the “perfect” examples in the degree–diameter problem — regular graphs that exactly meet the Moore bound for given degree k and diameter d. They’re extremely rare, and understanding when they can exist turns out to be a surprisingly rigid question. In this talk I’ll look at Moore graphs in general diameter and show how strong algebraic constraints narrow down the possibilities. Specializing to diameter 2, this leads to the famous condition that k can only be 3, 5, 7 or 57. *The asterisk in the title is because the k=57 case is still an unsolved problem. All in all, we know every Moore graph that exists except possibly the one corresponding to k=57.