Previous Conferences & Workshops

Sep
17
2008

Sum Product Abstract

7:45pm
Abstract

How "orthogonal" are the basic field operations "+" and "x"?

About two years ago Bourgain, Katz and Tao proved the following theorem (stated very informally). In every finite field, a set which does not grow much when we add all pairs of...

Sep
17
2008

Expander Abstract

7:45pm
Abstract

Expander graphs are extremely useful objects. In computer science, their applications range from network design, computational, derandomization, error correction, data organization and more. In mathematics they are used in topology, group...

Sep
17
2008

Goedel IAS Abstract

7:35pm
Abstract

Kurt Goedel had a basic interest in computation, and his research over the years has greatly influenced the development of computers and the science of computing. In this talk I will survey some fundamental connections between Goedel's work...

Sep
17
2008

Pierre Deligne Conference Agenda

7:30pm
Institute for Advanced Study School of Mathematics A conference on the occasion of the sixty-first birthday of Pierre Deligne Wolfensohn Hall October 17, 2005 - October 20, 2005 Agenda

Monday, October 17, 2005

11:30 am - 11:45 Introduction...

Sep
17
2008

Power Abstract

7:10pm
Abstract

Man has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. I'll describe two main aspects of this research on randomness...

Sep
16
2008

Computer Science/Discrete Mathematics Seminar II

Multilinear Computation
10:30am|S-101

Nisan and Wigderson defined the model of multilinear circuits as a natural model for computing multilinear polynomials (such as matrix product and the Permanent). We will go over several results regarding such circuits -- a few structural results...

Sep
15
2008

Computer Science/Discrete Mathematics Seminar I

On a Conjecture of Linial and Berge
11:15am|S-101

In 1982 Linial and Berge conjectured that there is some form of duality between partitioning the vertices of a directed graph to disjoint paths and finding a big set of vertices in it with a small chromatic number. In the talk I will discuss the...

Sep
10
2008

Special Seminar

The Formation of Black Holes in General Relativity
Demetrois Christodoulou
2:00pm|S-101
Sep
09
2008

Computer Science/Discrete Mathematics Seminar II

A Simple Proof of Bazzi's Theorem
10:30am|S-101

Pseudo-random generators that are secure against constant depth polynomial size circuits have been known since the seminal paper by Ajtai and Wigderson (1985). All available constructions of such generators, however, appear to be somewhat special...

Sep
02
2008

Joint IAS/Princeton University Geometric Analysis Seminar

Minimal Lagrangian Diffeomorphisms Between Domains in the Hyperbolic Plane
3:00pm|Fine Hall -- 314

Let $\Omega$ and $\tilde{\Omega}$ be domains in the hyperbolic plane with smooth boundary. Assume that both domains are uniformly convex, and have the same area. We show that there exists an area-preserving, orientation-preserving diffeomorphism $f...