Mathematics Program presents
Random Sorting Networks
Thursday, November 21, 2013
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.
For more information, call 845-758-7900, or e-mail firstname.lastname@example.org.
Time: 4:40 pm
Location: Hegeman 204
Send: E-mail this to a Friend
Subscribe: Save this Event: Subscribe / .ics File