Alternating Sign Matrices (ASMs)

Speaker: Nimisha Pahuja

Date: 27th March 2018 (Tuesday)
Time: 09:15 pm-10:15 pm
Venue: Lecture Hall I, Department of Mathematics

Abstract:

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.

Area: Combinatorics
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s