Sortable Elements in Cluster-algebra Computations

Wednesday, June 3, 2015 - 9:00am - 10:00am
Lind 305
Nathan Reading (North Carolina State University)
I will begin the talk by outlining (hopefully with help from the audience) what data we might want to compute (1) for each cluster variable (2) for each cluster and (3) for each cluster algebra. I will then discuss how the combinatorics of sortable elements can be applied to these problems. This leads naturally to a discussion of computation in Coxeter groups/root systems. I will argue that there are some insights from Stembridge's (dare I say the word) Maple packages coxeter/weyl that should be imported into Sage.
MSC Code: