Previous Conferences & Workshops

Apr
22
2011

Pseudorandomness in Mathematics and Computer Science Mini-Workshop

The Correlation of Multiplicative Characters with Polynomials over Finite Fields
Swastik Kopparty
11:30am|Simonyi Hall 101

This talk will focus on the complexity of the cubic-residue (and higher-residue) characters over GF(2^n), in the context of both arithmetic circuits and polynomials.

We show that no subexponential-size, constant-depth arithmetic circuit over GF(2)...

Apr
22
2011

Pseudorandomness in Mathematics and Computer Science Mini-Workshop

Random Walks in Linear Groups
Peter Varju
10:15am|Simonyi Hall 101
I will talk about a joint work with Jean Bourgain that establishes spectral gaps for random walks on SL_n(Z/qZ). Let S be a fixed finite and symmetric subset of SL_n(Z) which generates a Zariski dense subgroup. We show that words of length C log(q)...
Apr
21
2011

Joint IAS/Princeton University Number Theory Seminar

Algebraic Cycles and Euler Systems for Real Quadratic Fields
Henri Darmon
4:30pm|Fine Hall -- 214

I will discuss some possible applications of algebraic cycles and p-adic families of modular forms to the arithmetic of elliptic curves over abelian extensions of real quadratic fields. This is a report on work in progress with Victor Rotger and...

Apr
20
2011

Special Mathematical Physics Seminar

Universality in the 2D Coulomb Gas
Pierluigi Falco
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
Rong Ge
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...