Previous Conferences & Workshops

Nov
09
2009

Computer Science/Discrete Mathematics Seminar I

Why Sex?
Adi Livnat
11:15am|S-101

Sex has been called "the queen of problems in evolutionary biology" since it is pervasive in nature yet its functional significance has not been known. It has often been assumed that the shuffling of genes due to sex is an adaptation that...

Nov
05
2009

Analytic and Geometric Number Theory Seminar

Prime Chains and Applications
2:00pm|S-101

A sequence of primes $p_1, \dotsc , p_k$ is a prime chain if $p_{j+1} \equiv 1 \pmod{p_j}$ for each $j$. For example: 3, 7, 29, 59. We describe new estimates for counts of prime chains satisfying various properties, e.g. the number of chains with $p...

Nov
04
2009

Workshop on Topology: Identifying Order in Complex Systems

Computational Topology in the Study of Discrete Dynamical Systems
Sarah Day
3:30pm|S-101

With recent advances in computing power, numerical studies of nonlinear dynamical systems have become increasingly more popular. However, errors inherent to such studies may obscure the dynamics, or in the very least raise doubts about the existence...

Nov
03
2009

Computer Science/Discrete Mathematics Seminar II

Constructions of Expanders Using Group Theory
10:30am|S-101

I will survey some constructions of expander graphs using variants of Kazhdan property T . First, I describe an approach to property T using bounded generation and then I will describe a recent method based on the geometric properties of...

Nov
02
2009

Members’ Seminar

Smectic Topology, Tomography, and Topography
Randy Kamien
2:00pm|S-101

Smectic liquid crystals correspond to certain foliations of Euclidean space. I will discuss the topology of defects in the smectics. Typically the index of these topological defects is characterized via the fundamental group of the manifold of...

Nov
02
2009

Computer Science/Discrete Mathematics Seminar I

Grothendieck Inequalities, XOR Games, and Communication Complexity
Troy Lee
11:15am|S-101

An XOR game is a very simple model of evaluating a distributed function f(x,y) . With probability p(x,y) a Verifier sends questions x, y to Alice and Bob, respectively. Without communicating, Alice and Bob then output a, b in {-1,+1} in the hope...