Show your mathematics to the world!

Combinatorics of non-crossing partitions

Iain Gordon whiteboard
The board is a result of of Bin Shu from East China Normal University visiting Iain Gordon at the University of Edinburgh. In Iain’s words: “We were discussing the combinatorics of non-crossing partitions, and its generalisations to a bunch of different finite groups. The two diagrams are Cayley graphs of symmetric groups where one calculates this combinatorics. Most of that text is in black, but we were lazybones, so there is also a bit of green writing from my PhD student, about braid group actions on tensor categories and their asymptotic limits. Amazingly, the two topics are linked, through moduli spaces in algebraic geometry!”
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s