Speaker: Nimisha Pahuja
ASMs are a class of square matrices in combinatorics. The formula enumerating all nxn ASMs was conjectured in 1983 and it took nearly two decades to find a bijective proof for the identity. In this talk, I will briefly go over the proof and will discuss a few of the many objects like plane partitions, fully packed loops etc. which are in bijection with ASMs. Further, I will give some of their applications.
Prerequisites: Basic Linear Algebra and elementary ideas about bijections and recursions.