Add to Outlook calendar Add to Google calendar
Title: The Edelman-Greene bijection and 132-avoiding sorting networks
Speaker: Samu Potka (KTH, Stockholm, Sweden)
Date: 09 February 2018
Time: 3 pm
Venue: LH-1, Mathematics Department

Edelman and Greene constructed a bijective correspondence between the reduced words of the reverse permutation (n, n - 1, …, 2, 1) and standard Young tableaux of the staircase shape (n - 1, …, 1). Recently, motivated by random sorting networks, we studied this bijection and discovered some new properties in joint work with Svante Linusson. In this talk, I will discuss them and, if time permits, also a related project with Linusson and Robin Sulzgruber on random sorting networks where the intermediate permutations avoid the pattern 132.

Contact: +91 (80) 2293 2711, +91 (80) 2293 2265 ;     E-mail: chair.math[at]iisc[dot]ac[dot]in
Last updated: 18 May 2024