Event Quick Finder

November 2013

S M T W T F S
          1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30

Events Search

Keyword

Type

Calendar of Events

Return to Calendar

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.

For more information, call 845-758-7900, or e-mail gregland@bard.edu.

Location: Hegeman 204