26-03-2026
Speaker: Om Milind Joglekar
Abstract: You’ve played the New York Times staples like Wordle and the Crossword, but Connections introduces a unique mathematical hurdle. We’ve all been there - staring at the final eight tiles, knowing purple is the most annoying category ever created. In this talk we will demonstrate a few algorithms and strategies which help you solve the puzzle with optimal probability. We will also show that the given number of lives is just 2 shy of the number of lives you need to brute force the solution.
Time: 4:00 PM–5:00 PM
Venue: Ramanujan Hall
19-03-2026
Speaker: Sooraj A P
Abstract: We shall see a Fourier uncertainty principle for Gaussian-type functions due to Hardy and a complex analytic proof of the same.
Time: 4:00 PM–5:00 PM
Venue: Room 113
18-02-2026
Speaker: Om Milind Joglekar
Abstract: The Matrix-Tree Theorem states that the number of spanning trees of a connected graph G equals any cofactor of its Laplacian matrix L. In this talk a proof using the Cauchy-Binet formula will be presented and some applications explored.
Time: 5:30 PM–6:30 PM
Venue: Ramanujan Hall
11-02-2026
Speaker: Aditya Khambete
Abstract: In this talk we will introduce the notion of copulas to model the dependence in multivariate distributions, discuss how the classical notion fails for discrete multivariate distributions, and then use ideas from Geenens (2020) to extend the idea to multivariate discrete distributions.
Time: 5:30 PM–6:30 PM
Venue: Room 215
05-02-2026
Speaker: Satya Sai Aditya Duggaraju
Abstract: We give a proof of the Kolmogorov's extension theorem and, as an application, derive the Ionescu-Tuleca theorem. The talk only assumes familiarity with basic measure and probability theory.
Time: 2:00 PM–3:00 PM
Venue: Room 215
28-01-2026
Speaker: Poduri Pradyumna Datta
Abstract: The Matrix-Tree Theorem states that the number of spanning trees of a connected graph G equals any cofactor of its Laplacian matrix L. In this talk a proof using the Cauchy-Binet formula will be presented and some applications explored.
Time: 2:00 PM–3:00 PM
Venue: Room 215