Previous Conferences & Workshops

Apr
20
2011

Special Mathematical Physics Seminar

Universality in the 2D Coulomb Gas
2:00pm|S-101

The Coulomb Gas is a model of Statistical Mechanics with a special type of phase transition. In the first part of the talk I will review the expected features conjectured by physicists and the few mathematical results so far obtained. The second...

Apr
19
2011

Computer Science/Discrete Mathematics Seminar II

New Tools for Graph Coloring
10:30am|S-101

How to color $3$ colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses $n^{0.2130}$ colors. We explore the possibility that more levels of Lasserre Hierarchy can give improvements over...

Apr
18
2011

Computer Science/Discrete Mathematics Seminar I

Quantum Fingerprints that Keep Secrets
Dmitry Gavinsky
11:15am|S-101

In a joint work with Tsuyoshi Ito we have constructed a fingerprinting scheme (i.e., hashing) that leaks significantly less than log(1/epsilon) bits about the preimage, where epsilon is the error ("collision") probability. It is easy to see that...

Apr
14
2011

Galois Representations and Automorphic Forms Seminar

The Bernstein Center of the Category of Smooth W(k)[GL_n(F)]-Modules
David Helm
2:15pm|S-101

The Bernstein center plays a role in the representation theory of locally profinite groups analogous to that played by the center of the group ring in the representation theory of finite groups. When F is a finite extension of Q_p, we discuss the...

Apr
13
2011

Members’ Seminar

Intersections of Polynomial Orbits, and a Dynamical Mordell-Lang Conjecture
Michael Zieve
2:00pm|S-101

Let f and g be nonlinear polynomials (in one variable) over the complex numbers. I will show that, if there exist complex numbers a and b for which the orbits {a, f(a), f(f(a)), ...} and {b, g(b), g(g(b)), ...} have infinite intersection, then f and...

Apr
11
2011

Computer Science/Discrete Mathematics Seminar I

Graph Sparsification by Edge-Connectivity and Random Spanning Trees
Nick Harvey
11:15am|S-101

A "sparsifier" of a graph is a weighted subgraph for which every cut has approximately the same value as the original graph, up to a factor of (1 +/- eps). Sparsifiers were first studied by Benczur and Karger (1996). They have wide-ranging...

Apr
08
2011

Geometry/Dynamical Systems Seminar

The Dehn Function of SL(n;Z)
4:00pm|S-101

The Dehn function is a group invariant which connects geometric and combinatorial group theory; it measures both the difficulty of the word problem and the area necessary to fill a closed curve in an associated space with a disc. The behavior of the...