Sunday, October 24, 2021

Akshaa Vatwani (IIT, Gandhinagar) - Thursday October 28, 3:55 PM - 5:00 PM (IST)

 Dear all, 

The next speaker in our seminar is Akshaa Vatwani of IIT, Gandhinagar

Talk Announcement:

Title: Limitations to equidistribution in arithmetic progressions

Speaker: Akshaa Vatwani (IIT, Gandhinagar)
When: Thursday, October 28, 2021 - 4:00 PM - 5:00 PM (IST) 

Where: Zoom:


Tea or Coffee: Please bring your own.


It is well known that the prime numbers are equidistributed in arithmetic progressions. Such a phenomenon is also observed more generally for a class of arithmetic functions. A key result in this context is the Bombieri-Vinogradov theorem which establishes that the primes are equidistributed in arithmetic progressions ``on average" for moduli q in the range q \le x^{1/2 -\epsilon } for any \epsilon>0. In 1989, building on an idea of Maier, Friedlander and Granville showed that such equidistribution results fail if the range of the moduli q is extended to q \le x/ (\log x)^B  for any B>1. We discuss variants of this result and give some applications. This is joint work with Aditi Savalia.

Sunday, October 10, 2021

Meesue Yoo (Chungbuk National University, Korea) - Thursday, October 14, 2021 - 3:55 PM (IST)

 The next speaker in our seminar is Meesue Yoo of Chungbuk National University, Korea. 

Talk Announcement:

Title: Elliptic rook and file numbers

Speaker: Meesue Yoo (Chungbuk National University, Korea)
When: Thursday, October 14, 2021 - 4:00 PM - 5:00 PM (IST)  (7:30 PM in S. Korea)

Where: Zoom: Please write to the organizers if you don't have the link.


Tea or Coffee: Please bring your own.


In this talk, we construct elliptic analogues of the rook numbers and file numbers by attaching elliptic weights to the cells in a board. We show that our elliptic rook and file numbers satisfy elliptic extensions of corresponding factorization theorems which in the classical case was established by Goldman, Joichi and White and by Garsia and Remmel in the file number case. This factorization theorem can be used to define elliptic analogues of various kinds of Stirling numbers of the first and second kind, and Abel numbers. 

We also give analogous results for matchings of graphs, elliptically extending the result of Haglund and Remmel.

This is joint work with Michael Schlosser.