Mon, June 22, 2020
Public Access

Category:
Category: All

22
June 2020
Mon Tue Wed Thu Fri Sat Sun
1 2 3 4 5 6 7
8 9 10 11 12 13 14
15 16 17 18 19 20 21
22 23 24 25 26 27 28
29 30          
8:00am  
9:00am  
10:00am  
11:00am  
12:00pm  
1:00pm  
2:00pm  
3:00pm [3:00pm] Krishna Hanumanthu:Chennai Mathematical Institute, Chennai
Description:
Date and Time: Monday, 22 June, 3pm to 4pm IST (joining time: 2.50pm IST) Google Meet link: meet.google.com/gxv-jqky-vmy Speaker: Krishna Hanumanthu Affiliation: Chennai Mathematical Institute, Chennai Title: Seshadri constants and rationality questions. Abstract: Seshadri constants are a local measure of positivity of line bundles and have many interesting applications. An important question is whether Seshadri constants can be irrational. While the answer is expected to be yes, currently we do not know any examples of irrational Seshadri constants. In this talk, we will start with basics on Seshadri constants and discuss important results and connections to well known questions. We will then focus on rationality questions and exhibit irrational Seshadri constants assuming some conjectures are true. The talk will be based on two joint works, one with B. Harbourne and another with L. Farnik, J. Huizenga, D. Schmitz and T. Szemberg. I will try to keep most of the talk accessible to anyone with knowledge of basic algebraic geometry.
4:00pm [4:00pm] Dr. Pranabendu Misra (Max Planck Institute for Informatics, Saarbrucken, Germany)
Description:
Speaker: Dr. Pranabendu Misra (Max Planck Institute for Informatics, Saarbrucken, Germany) Date-time: Monday (June 22), 4-5 PM (Webex Meeting details below) Title: A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments Abstract ----------- A Tournament is a directed graph T such that every pair of vertices is connected by an arc. A Feedback Vertex Set is a set S of vertices in T such that T−S is acyclic. We consider the Feedback Vertex Set problem in tournaments, where the input is a tournament T and a weight function w:V(T)→N and the task is to find a feedback vertex set S in T minimizing w(S). We give the first polynomial time factor 2 approximation algorithm for this problem. Assuming the Unique Games conjecture, this is the best possible approximation ratio achievable in polynomial time. Meeting link: https://iitbombay.webex.com/iitbombay/j.php?MTID=md23f92c26686aa030456a9d08390379d Meeting number:166 483 6041 Password:RKypRMZy888
5:00pm  
6:00pm