Seminar Event Detail


Combinatorics

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

Title:  TASEP on a circle with many types of particles

Abstract:   Consider words of length N>n with letters from the alphabet {1,...,n}. We study the Markov chain where a letter i can jump to the left if the letter to its left is larger. This is called a multi-type TASEP and if all jump rates are equal, Ferrari and Martin have designed a model which gives a nice combinatorial description of the stationary measure. I will describe this model and discuss the problem when the different letters (particles) have different jump rates. Our work leads to progress on a recent positivity conjecture by Lam and Williams stemming originally from work by Lam on reduced infinite words in Affine Coxeter groups.

This is joint work with Arvind Ayyer.

Files:


Speaker:  Svante Linusson
Institution:  KTH

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.