Prof. Abhyankar Birthday Symposium (2024)

Bhaskaracharya Pratishthana, Pune is organising ‘Professor Shreeram S. Abhyankar
Birthday Symposium’ on the occasion of birthday of Prof. Shreeram S. Abhyankar (1930-
2012).
Day and Date: Monday, 22nd July 2024 at Bhaskaracharya Pratishthana, Pune.

Venue: Audio-visual Hall, Bhaskaracharya Pratishthana Pune.

Online Mode: Join Zoom Meeting  https://us06web.zoom.us/j/86951416994?pwd=PsMBoD2z598XkR1braX5qtfLUmiAxu.1
Meeting ID: 869 5141 6994  Passcode: 649652

Speakers and Topics

Prof. Soumen Maity is currently a professor of Mathematics at IISER Pune.  He obtained his PhD from Indian Statistical Institute, Kolkata and held postdoctoral positions at Lund University and the University of Ottawa. He was a faculty at IIT Kharagpur before joining IISER Pune. His main areas of interest are parameterized algorithms and discrete mathematics.

Title: Parameterized Algorithms
Abstract: Many optimization problems in theoretical computer science that we  want to solve are often NP-hard or worse, but somehow, they need to get solved. Over the years, multiple paradigms for coping with NP-hardness have been  introduced: for instance, approximation algorithms and randomized algorithms  were all borne out of a desire to solve hard problems by relaxing the problem. Within the last 20 years, a new paradigm called parameterized complexity has  been introduced, where one measures the time complexity of an algorithm not  just in terms of the input length but also a small side parameter. In this talk we give an overview of parameterized algorithms.

Prof. Pradipkumar H. Keskar (Mathematics Department, BITS Pilani, Pilani Campus)

Title: Polynomial Criterion for Some Combinatorial Objects 

Abstract: Besides proving strong theorems in Mathematics, Professor
Abhyankar distinguished himself from others through his strong views on the
kind of mathematics he preferred. These views are propounded in his poem titled
’Polynomials and Power Series’, the article ’Historical ramblings in Algebraic
Geometry and related Algebra’, as well as several other presentations. In this
tribute to him, we present our small attempt to bring certain combinatorial
objects, called difference sets, in this realm by giving a polynomial criterion for
them.