


Number theory seminar
Date and time: Monday, 28th November 2022, 4 pm
Venue: Ramanujan Hall
Speaker: Anatareep Mandal, IIT Madras
Title: Heat kernel analysis and the supnorm bound problem  A deeper dive
Abstract: This is in continuation of the earlier talk on 'Uniform supnorm bounds for Siegel cusp forms' last week. We elaborate on FlenstedJensen's complex reduction technique for calculating spherical functions on real groups by reducing it to the complex case and then take a deeper dive into the estimation of supnorm bound problem for cusp forms via analysis of heat kernels constructed using FlenstedJensen's method.
Date and time: Tuesday, 29 November at 2.30 pm Venue: Room 215 Speaker: Arindam Banerjee, IIT Kharagpur Title: A binomial type formula for integral closures of powers of monomial ideals. Abstract: Let I and J be two ideals in two polynomial rings A=K[x_1,....,x_m] and B=[y_1,...,y_n] respectively. Tai Ha et al. proved a binomial formula for $(I+J)^(n)$ in (A \tensor B) in terms of symbolic powers I^(t) and J^(t') where t and t' are less than or equal to n. A similar formula fails for integral closures of powers of ideals, even for monomial ideals. It has been shown in a recent joint work with Tai Ha that for monomial ideals some binomial type formula holds for integral closures of powers of (I+J). Using this formula we have also shown some formulas for regularity (and depth) of integral closures of powers of (I+J) in terms of regularity (and depth) of integral closures of lower powers of I and J. In this talk, we plan to discuss this work and some potential problems.
Statistics seminar
Date and time: Tuesday, 29th November at 3:00 pm
Venue: Ramanujan Hall.
Speaker: Subrata Kundu, George Washington University (USA),
Title: Some remarks on generalizations of the likelihood function and the likelihood principle
Abstract: The sufficiency principle (SP), the weak conditionality principle (WCP), the likelihood function (LF), and the likelihood principle (LP) for a general statistical inference problem are discussed. It is argued that a general statistical problem can be regarded as a prediction problem by treating the quantity (z) of inferential interest as the realized but unobserved value of a random vector Z. The LF is defined as the density of the data given z and the unknown fixed parameters of the model, considered as a function of z and θ. The SP and WCP are modified such that they are equivalent to the LP based on the proposed LF.
(Joint work with Tapan K. Nayak)
Mathematics Colloquium
======================
Speaker: Arindam Banerjee, IIT Kharagpur
Date: 30 November, 2022 at 2.30 pm
Venue: Ramanujan Hall
Title: CastelnuovoMumford regularity of edge Ideals of graphs and their powers
Abstract: Regularity of edge ideals of graphs and their powers have been a very popular area of research in commutative algebra for the last one decade.
Edge ideals are one of the rare classes of ideals where linear resolution of the ideal implies linear resolution for higher powers i.e minimum possible regularity
for an edge ideal implies minimum possible regularity for all its higher powers(proved by Herzog, Hibi and Zheng). It was also characterised (by Froberg)
that an edge ideal has linear resolution (or minimum possible regularity) if and only if the underlying graph is chordal.This motivated people to
take up various projects for finding sharp upper bounds for regularity for various powers of edge ideals. Two questions largely guided this research:
1. The NevoPeeva Question: Is it true that all higher powers (greater than equal to 2) have linear resolutions for edge ideals with
a. linear presentation (that is edge ideals whose first differential matrix of minimal free resolution has linear entries) and
b. regularity less than equal to $3$?
2. The sharp upper bound Conjecture for regularity of powers in terms of the regularity of the ideal: It is believed that
regularity of an edge ideal is r implies for the s th power the regularity is bounded above by 2s+r1.
There has been much progress towards both of these but both remain open so far. Recently the second question has been
solved for all bipartite graphs. Also for all graphs the bound has been proven for the second power (r+2).
There has been some effort to study how regularity behaves "on an average for all graphs" using some probabilistic methods.
In this talk we plan to discuss the history and current state of research in this area.
Prof MS Raghunathan will give a course of lectures aimed at beginning PhD students
on a topic of basic importance to all of mathematics. Title and abstract are given below.
The course will begin on Monday 17th October at 4pm in the room A1A2 of CDEEP on the ground floor of the Math building. Each lecture will be of 90 minutes. The course will run
roughly through the middle of December, so about 8 lectures. Since Monday 24th October is Deepawali, the lecture will be organized on 26th afternoon for which I will separately announce the precise timing.
It will be a lecture course in hybrid mode so that others not in IIT can also benifit from this course. Feel free to tell your friends in case it may interest them. Here is the zoom link in case you cannot attend in person:
Hope to see you there!
Best wishes, Dipendra

Title: Compact Lie groups and their representations
Abstract: In this course I will first talk about the structure theory of compact Lie groups, beginning with the fact that a compact connected Lie group is an almost direct product of the identity connected component of its centre and its commutator subgroup (which is closed subgroup) conjugacy of maximal tori and the fact that every element is contained in a maximal torus. In the course of proving these results, some results on the topology of compact Lie groups which will also be proved. I will then establish Weyl's theorem which asserts that if G is a compact connected Lie group and [G,G]=G, π1(G,e) is finite (and hence the universal covering of a compact group whose abelianisation is trivial is a compact. Then I will introduce roots and weights and the Dynkin diagram of the compact group and sketch a proof of the fact that the Dynkin diagram determines the group locally. The remaining lectures will be devoted to representation theory. I will establish the bijective correspondence between 'Dominant Weights' and irreducible representations. The course will end with the Weyl Character Formula for the character of an irreducible representation corresponding to a 'dominant' weight. The entire theory is essentially the same as the representation theory of reductive algebraic groups. I will off and on indicate how the two are related.
I will be assuming some familiarity with basic theory of Lie groups such as the correspondence between Lie subalgebras of the Lie group and Lie subgroups of the Lie groups; also with some basic results from algebraic topology.
Mathematics ColloquiumII
Date and time: Thursday, 1 December 2022, 3 pm
Venue: Ramanujan Hall
Speaker: Prashant Singh, IIT Jammu
Title: Maximal Hyperplane Sections of Determinantal Varieties of Symmetric Matrices over Finite Fields
Abstract: Let X = (Xij ) be an m × n generic matrix whose entries are independent indeterminates over a field F. The classical determinantal variety Dt = Dt(m,n) given by the vanishing of (t+1)×(t+1) minors of X has been extensively studied since antiquity. Since the defining equations have coefficients ±1, the variety is also defined over any finite field Fq. In fact, Dt has a large number of Fqrational points and that makes it a useful object from the point of view of applications to coding theory. An explicit formula for Dt(Fq) is wellknown and goes back at least to Landsberg (1893). Partly from the viewpoint of applications, one is also interested in the following questions concerning the cardinalities of hyperplane sections of Dt:
(i) What are the possible values of Dt∩H(Fq), where H is a F_qrational hyperplane in the projective space?
(ii) What is the maximum possible value of Dt ∩H(Fq), where H varies over the hyperplanes as in (i) above?
These have been answered relatively recently. In fact, various approaches for the first question are possible, e.g., using the eigenvalues of certain association schemes or variants of the socalled MacWilliams identities. We will begin by reviewing these developments. Then we consider the case where X = (Xij) is a generic symmetric matrix of size m × m, and look at the corresponding variety St = St(m) given by the vanishing of (t + 1) × (t + 1) minors of X. Here, the number of Fqrational points were determined by Carlitz (1954) in a special case, and by MacWilliams (1969) in the general case. In this case, the question analogous to (i) is open, in general, whereas an answer to (ii) has been obtained recently when t is even, while a conjectural answer is proposed when t is odd. We will give a motivated account of these results, which are obtained in joint work with Peter Beelen and Trygve Johnsen.
Prof. Nitsure will continue his lecture series on 'Moduli and Stack' on
Thursday 5:00 pm in Ramanujan hall.