Previous Conferences & Workshops

May
08
2008

Joint IAS/Princeton University Number Theory Seminar

The Divisor Matrix, Dirichlet Series and SL(2,Z)
P. Sin
4:30pm|S-101

The divisor matrix is indexed by the natural numbers with (i,j) entry equal to one if i divides j and 0 otherwise. The convolution of a Dirichlet series with the Riemann zeta function corresponds to multiplication of the sequence of coefficients by...

May
07
2008

Algebro-Geometric Derived Categories and Applications

Representations of Rational Cherednik Algebras and Miracles of Science
10:30am|S-101

I will report on a work in progress joint with Andrei Okounkov. We extend the methods developed in an earlier work with Mirkovic and Rumynin on modular representations of semi-simple Lie algebras to representation of symplectic reflection algebras...

May
01
2008

Special Seminar

Equivariant Cohomology of Laumon's Quasiflags Spaces and the Quantum Calogero-Moser Hamiltonian
Andrei Negut
2:00pm|S-101

We will introduce certain operators A(m) on the equivariant cohomology ring of the Laumon quasiflags spaces M_d . The character of A(m) will be equal to the generating function Z(m) of the integrals of the Chern polynomial of the tangent bundle of...

Apr
29
2008

Algebro-Geometric Derived Categories and Applications

Categorification of quantum groups and Floer theory
Hao Zheng
2:00pm|S-101

This talk is concerned with categorification of quantum Kac-Moody algebras and their integrable representations. First, I show how to fulfill the task by using sheaf theory. Then I will argue that the constructions could be well understood and...

Apr
29
2008

Computer Science/Discrete Mathematics Seminar II

Optimal Monotone Encodings
Rani Hod
10:30am|S-101

Moran, Naor and Segev have asked what is the minimal r = r(n, k) for which there exists an (n,k)-monotone encoding of length r , i.e., a monotone injective function from subsets of size up to k of {1, 2,...,n} to r bits. Monotone encodings are...

Apr
28
2008

Computer Science/Discrete Mathematics Seminar I

Security Under Key-Dependent Inputs
Shai Halevi
11:15am|S-101

In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by Black, Rogaway, and Shrimpton in the context of randomized encryption...