Seminar Event Detail


Combinatorics

Date:  Friday, October 26, 2012
Location:  3866 East Hall (4:10 PM to 5:00 PM)

Title:  Relating Edelman-Greene insertion and the Little map

Abstract:   The study of reduced decompositions of symmetric group elements has been a rich source for combinatorial problems since being introduced by Stanley in 1980. Shortly after, major breakthroughs were made via an RSK-like insertion algorithm developed by Edelman and Greene and algebraic results of Lascoux and Schutzenberger. In 2000 David Little demonstrated a bijective realization of Lascoux and Schutzenberger's results. We relate Edelman-Greene insertion to the Little map, tying together this body of work and proving new properties about each map. This is joint work with Benjamin Young.

Files:


Speaker:  Zach Hamaker
Institution:  Dartmouth College

Event Organizer:     

 

Edit this event (login required).
Add new event (login required).
For access requests and instructions, contact math-webmaster@umich.edu

Back to previous page
Back to UM Math seminars/events page.