|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Postdoc talk
Speaker: Dr Sulakhana Chowdhury, IISER Thiruvananthapuram
Host: Shripad Garge
Title: Young modules and filtration multiplicities of Brauer algebras of type C
Time, day and date: 11:30:00 AM - 12:30:00 PM, Monday, December 01
Venue: Online (https://meet.google.com/pww-xisc-qym)
Abstract: The Brauer algebras of type C arise as subalgebras of the classical Brauer algebras, spanned by all symmetric diagrams. In this talk, we discuss the construction of permutation modules and Young modules of Brauer algebras of type C. We show that if the characteristic of the field is neither 2 nor 3, then every permutation module of the Brauer algebra of type C decomposes as a direct sum of indecomposable Young modules.
(This is joint work with Geetha Thangavelu)
Mathematics Colloquium
Speaker: Frank Thorne, University of South Carolina
Host: Parthanil Roy
Title: Fourier Analysis in Arithmetic Statistics
Time, day and date: 4:00:00 PM – 5:00:00 PM. Wednesday, December 03
Venue: Ramanujan Hall
Abstract: I will give an overview of what "arithmetic statistics" is about, and describe how many questions in the subject can be described in terms of counting lattice points. I will also describe some of my work, joint with a variety of collaborators, aimed at sharpening some of our tools by introducing techniques from Fourier analysis.
Numerical Analysis Seminar
Speaker: Prof. Dr. Joscha Gedicke, Institut für Numerische Simulation, Universitat Bonn
Host: Neela Nataraj
Title: $P_1$ and SIP Discretizations for Elliptic Optimal Control with Pointwise State Constraints
Time, day and date: 4:00:00 PM - 5:00:00 PM, Thursday, December 04
Venue: Ramanujan Hall
Abstract: We develop and analyze finite element discretizations for elliptic distributed optimal control problems with pointwise state constraints on general polygonal/polyhedral domains. Two $P_1$ conforming methods and a symmetric interior penalty formulation are considered, leading to discrete quadratic programs with simple box constraints that can be efficiently solved using a primal-dual active set strategy. Theoretical results are established and supported by numerical experiments.