Random Sorting NetworksRandom Sorting Networkshttp://www.haverford.edu/calendar/details/256971KINSC H1092013-11-25T16:15:002013-11-25T17:30:00
November 25, 4:15PM–5:30PM
Zack Hamaker of Dartmouth College
Tea will be served at 3:30 pm - KINSC Math Lounge, H208 and the talk will begin at 4:00 pm in Hilles H109.
A sorting network is a way to reverse a list of numbers by swapping adjacent entries in the list using as few swaps as possible. We will discuss what a random sorting network looks like. To do so, we will highlight the role of simulation in mathematics, use combinatorial and probabilistic techniques and explore what it means to describe a random object. There will be open problems. There will be surprising conjectures. We will look at the best pictures. It will be assumed that the audience is familiar with limits.
For More Info
John P. Dougherty