Math Colloquium: "Random Sorting Networks"Math Colloquium: "Random Sorting Networks"http://www.haverford.edu/calendar/details/255591KINSC H109.2013-11-25T16:00:002013-11-25T17:00:00
November 25, 4:00PM–5:00PM
Zach Hamaker (Dartmouth College). KINSC H109.
Bi-College Math Colloquium
"Random Sorting Networks"
Zach Hamaker, Dartmouth College.
Talk at 4 in KINSC H109
Tea at 3:30 in the Math Lounge (KINSC H208)
Abstract: 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