Divisional Events

<< Back to Events

Mathematics Program presents

Random Sorting Networks

Thursday, November 21, 2013

[Random Sorting Networks]
A lecture by Zachary Hamaker '08

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. The target audience is all Bard students.

Location: Hegeman 204