Upcoming talks

Departmental seminars

Speaker: Prof. Ananthnarayan Hariharan, IIT Bombay.

Title: Linear Algebra & Beyond 

Abstract: The talk will begin by illustrating the geometry behind some of the basic objects in linear algebra, and discuss how these lead to more general constructs impacting other fields (no pun intended). We will see applications to solutions of linear homogeneous ODEs, and the idea of projection leading to applications in Statistics. If time permits, we will see a glimpse of how this has a bearing on the theory of modules over a PID. The talk will be self-contained as far as possible, with lots of examples.

Date: 14 October 2025, Tuesday

Time: 2:00 PM - 3:15 PM

Venue: A2-519

Speaker: Dr. Sushobhan Bandopadhyay, TIFR Mumbai.

Title: Parameterized complexity of Graph Connectivity, Partitioning, and Fair Allocation

Abstract: This talk focuses on problems of graph connectivity, partitioning, and their relation to fair allocation from parameterized complexity aspects. We begin with the (A,ℓ)-Path Packing problem, where given a graph G, the goal is to find the maximum number of vertex‐disjoint paths of length ℓ between disjoint pairs in a given set A of vertices, and strengthen the hardness result of Belmonte et al. (Algorithmica ’22) via a new Separation Lemma, akin to the Isolation Lemma. Next, we introduce the Shortest Non-Separating Path problem, which seeks a minimum-length path whose removal preserves connectivity; we show this is W[1]-hard for the parameter path length, while its edge-deletion analogue admits a matroid-based FPT solution. We then generalize π-Deletion and k-way Cut, where we aim to delete edges to partition the graph into k components such that each component is in a hereditary class π of graphs (e.g., trees, bipartite, chordal). We explore its classical and parameterized complexity. Finally, we study Fair Allocation with conflicting items as selecting independent sets in a conflict graph to maximize welfare, which can be considered as another variant of constrained cut. Here we present tractability and intractability results under various natural parameters. 

Date: 22 October 2025, Wednesday

Time: 3:30 PM - 4:30 PM

Venue: A2-519

Student seminar

TBA

About Department of Mathematics

The department was established in 2016, since the inception of the institute. This young department has a strong teaching and research faculty profile. The faculties are involved in fundamental research and teaching at various levels. One of our main purposes is to train the students with a diverse and solid foundation in mathematics and motivate them for further studies.

We offer a regular PhD program in our department. We also offer a BS-MS (Interdisciplinary Sciences) program with the Department of Biosciences and Bioengineering, Chemistry, and Physics. Our department is responsible for conducting the Mathematics Major branch in this program. Furthermore, we offer a B.Tech (Mathematics and Computing) program in collaboration with the Department of  Computer Science and Engineering. 

We have faculty doing research in diverse branches of mathematics, which include Commutative Algebra, Functional Analysis, Graph Theory, Number Theory, Numerical Analysis, and Representation Theory.

  Gallery | Explore the events organized at the Department of Mathematics