Previous Conferences & Workshops

Jan
28
2014

Computer Science/Discrete Mathematics Seminar II

Simplicial complexes as expanders
10:30am|S-101

Expanders are highly connected sparse graphs. Simplicial complexes are a natural generalization of graphs to higher dimension, and the notions of connectedness and expansion turn out to have interesting analogues, which relate to the homology and...

Jan
27
2014

Members’ Seminar

Rigidity and Flexibility of Schubert classes
2:00pm|S-101

Consider a rational homogeneous variety \(X\). (For example, take \(X\) to be the Grassmannian \(\mathrm{Gr}(k,n)\) of \(k\)-planes in complex \(n\)-space.) The Schubert classes of \(X\) form a free additive basis of the integral homology of \(X\)...

Jan
27
2014

Computer Science/Discrete Mathematics Seminar I

Unique games, the Lasserre hierarchy and monogamy of entanglement
Aram Harrow
11:15am|S-101

In this talk, I'll describe connections between the unique games conjecture (or more precisely, the closely relatedly problem of small-set expansion) and the quantum separability problem. Remarkably, not only are the problems related, but the...

Jan
22
2014

Mathematical Conversations

A new viewpoint on analytic geometry
Oren Ben-Bassat
6:00pm|Dilworth Room

What is the difference between algebraic and analytic geometry? Is there some way to construct moduli "spaces" in analytic geometry (in the Archimedean or non-Archimedean contexts)? Is there a common language for expressing the foundations of...

Jan
22
2014

Non-equilibrium Dynamics and Random Matrices

Exact formulas for random growth off a flat interface
Daniel Remenik
2:00pm|S-101

We will describe formulas for the asymmetric simple exclusion process (ASEP) starting from half-flat and flat initial data. The formulas are for the exponential moments of the height function associated with ASEP. They lead to explicit formulas for...

Jan
21
2014

Non-equilibrium Dynamics and Random Matrices

A quantitative Brunn-Minkowski inequality and estimates on the the remainder in the Riesz rearrangement inequality
Eric Carlen
2:00pm|S-101

We prove a quantitative Brunn-Minkowski inequality for sets \(E\) and \(K\), one of which, \(K\), is assumed convex, but without assumption on the other set. We are primarily interested in the case in which \(K\) is a ball. We use this to prove an...

Jan
21
2014

Computer Science/Discrete Mathematics Seminar II

Deeper Combinatorial Lower Bounds
Siu Man Chan
10:30am|S-101

We will discuss space and parallel complexity, ranging from some classical results which motivated the study, to some recent results concerning combinatorial lower bounds in restricted settings. We will highlight some of their connections to boolean...

Dec
16
2013

Computer Science/Discrete Mathematics Seminar I

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball
11:15am|S-101

We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even \(n\), there exists an explicit bijection \(f\) from the \(n\)-dimensional Boolean cube to the Hamming ball of...