Speaker: Colin Defant (MIT)
 
Title: Stack-Sorting and Beyond

Abstract: In 1990, West introduced the stack-sorting map, a combinatorially-defined operator on the set of permutations of size n that serves as a deterministic analogue of Knuth's stack-sorting machine. I will discuss a method for computing the fertility of an arbitrary permutation, which is simply the number of preimages of the permutation under the stack-sorting map. This method uses combinatorial objects called valid hook configurations. Very surprisingly, valid hook configurations also appear in a formula that converts from free to classical cumulants in free probability theory. This allows us to use tools from free probability theory to prove deep facts about the stack-sorting map. On the other hand, we can also leverage the stack-sorting map to prove a new theorem that relates cumulants with special families of binary plane trees called troupes.

Founders Building (FO), 2.404
800 W. Campbell Road, Richardson, Texas 75080-3021

Natural Sciences & Mathematics
Nathan Williams
Email

UTD strives to create inclusive and accessible events in accordance with the Americans with Disabilities Act (ADA). If you require an accommodation to fully participate in this event, please contact the event coordinator (listed above) at least 10 business days prior to the event. If you have any additional questions, please email ADACoordinator@utdallas.edu and the AccessAbility Resource Center at accessability@utdallas.edu.

Event Publishing

Add an Event 

Submit your own event using our simple event submission form. It only takes a minute!

Event Publisher Training 

Learn best practices to maximize the calendar’s latest features.

Make a Calendar Feed 

Embed events anywhere on the web with our widget builder.

Explore Comet Calendar

Events by Email

Get a personalized list of events in your inbox with our digest emailer.

30-second Survey

Share your feedback and suggestions on how we can improve the Comet Calendar.

The University of Texas at Dallas