Seminar Event Detail


Combinatorics

Date:  Friday, March 20, 2015
Location:  3866 East Hall (4:10 PM to 5:00 PM)

Title:  Dual filtered graphs

Abstract:   Using the Hecke insertion algorithm of Buch-Kresh-Shimozono-Tamvakis-Yong, we define a K-theoretic analogue of Fomin's dual graded graphs called dual filtered graphs. The key formula in the definition is DU-UD=D+I. We discuss two main constructions of dual filtered graphs: the Mobius construction, which corresponds to natural insertion algorithms, and the Pieri construction, which is an algebraic construction. We end with some enumerative results using up-down calculus. This is work with Pasha Pylyavskyy.

Files:


Speaker:  Rebecca Patrias
Institution:  U. Minnesota

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.